Los puntos clave no están disponibles para este artículo en este momento.
We show that every cubic graph on n vertices contains a spanning subgraph in which the number of vertices of each degree deviates from n4 by at most 12, up to three exceptions. This resolves the conjecture of Alon and Wei (Irregular subgraphs, Combin. Probab. Comput. 32 (2) (2023), 269--283) for cubic graphs.
Lužar et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: