Abstract
Corrádi and Hajnal proved that for every k ≥ 1 and n ≥ 3k, every n-vertex graph with minimum degree at least 2k contains k vertex-disjoint cycles. This implies that every 3k-vertex graph with maximum degree at most k − 1 has an equitable k-coloring. We prove that for s∈{3,4} if an sk-vertex graph G with maximum degree at most k has no equitable k-coloring, then G either contains K k+1 or k is odd and G contains K k,k . This refines the above corollary of the Corrádi-Hajnal Theorem and also is a step toward the conjecture by Chen, Lih, and Wu that for r ≥ 3, the only connected graphs with maximum degree at most r that are not equitably r-colorable are K r,r (for odd r) and K r+1.
Similar content being viewed by others
References
N. Alon and Z. Füredi: Spanning subgraphs of random graphs, Graphs and Combinatorics 8 (1992), 91–94.
N. Alon and R. Yuster: H-factors in dense graphs, J. Combinatorial Theory, Ser. B 66 (1996), 269–282.
J. Blazewicz, K. Ecker, E. Pesch, G. Schmidt and J. Weglarz: Scheduling computer and manufacturing processes. 2nd ed., Berlin, Springer, (2001).
B.-L. Chen, K.-W. Lih and P.-L. Wu: Equitable coloring and the maximum degree, Europ. J. Combinatorics 15 (1994), 443–447.
K. Corrádi and A. Hajnal: On the maximal number of independent circuits in a graph, Acta Math. Acad. Sci. Hungar. 14 (1963), 423–439.
A. Hajnal and E. Szemerédi: Proof of a conjecture of P. Erdős, in: Combinatorial Theory and its Application (P. Erdős, A. Rényi and V. T. Sós, eds.), 601–623, North-Holland, London, 1990.
S. Janson and A. Ruciński: The infamous upper tail, Random Structures and Algorithms 20 (2002), 317–342.
H. A. Kierstead and A. V. Kostochka: A Short Proof of the Hajnal-Szemerédi Theorem on equitable coloring, Combinatorics, Probability and Computing 17 (2008), 265–270.
H. A. Kierstead and A. V. Kostochka: An Ore-type theorem on equitable coloring, J. Combinatorial Theory Series B 98 (2008), 226–234.
H. A. Kierstead and A. V. Kostochka: Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture, Combinatorica 30 (2010), 201–216.
H. A. Kierstead and A. V. Kostochka: Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring, J. Graph Theory 71 (2012), 31–48.
H. A. Kierstead, A. V. Kostochka, M. Mydlarz and E. Szemerédi: A fast algorithm for equitable coloring, Combinatorica 30 (2010), 217–224.
H. A. Kierstead, A. V. Kostochka and G. Yu: Extremal graph packing problems: Ore-type versus Dirac-type, in: Surveys in Combinatorics 2009 (eds.S. Huczynska, J. Mitchell and C. Roney-Dougal), London Mathematical Society Lecture Note Series 365, Cambridge University Press, Cambridge (2009) 113–136.
A. V. Kostochka, M. Pelsmajer and D. B. West: A list analogue of equitable coloring, J. Graph Theory 44 (2003), 166–177.
A. V. Kostochka and K. Nakprasit: On equitable Δ-coloring of graphs with low average degree, Theor. Comp. Sci. 349 (2005), 82–91.
K.-W. Lih and P.-L. Wu: On equitable coloring of bipartite graphs, Discrete Math. 151 (1996), 155–160.
S. V. Pemmaraju: Equitable colorings extend Chernoff-Hoeffding bounds, in: Proceedings of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science (APPROX-RANDOM 2001), 2001, 285–296.
V. Rödl and A. Ruciński: Perfect matchings in ε-regular graphs and the blow-up lemma, Combinatorica 19 (1999), 437–452.
B. F. Smith, P. E. Bjorstad and W. D. Gropp: Domain decomposition. Parallel multilevel methods for elliptic partial differential equations, Cambridge Cambridge University Press, (1996).
A. Tucker: Perfect graphs and an application to optimizing municipal services, SIAM Review 15 (1973), 585–590.
H.-P. Yap and Y. Zhang: The equitable Δ-colouring conjecture holds for outerplanar graphs, Bull. Inst. Math. Acad. Sin. 5 (1997), 143–149.
H.-P. Yap and Y. Zhang: Equitable colourings of planar graphs, J. Comb.Math. Comb.Comp. 27 (1998), 97–105.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research of this author is supported in part by NSA grant H98230-12-1-0212.
Research of this author is supported in part by NSF grant DMS-0965587 and by grants 12-01-00448 and 12-01-00631 of the Russian Foundation for Basic Research.
Rights and permissions
About this article
Cite this article
Kierstead, H.A., Kostochka, A.V. A refinement of a result of Corrádi and Hajnal. Combinatorica 35, 497–512 (2015). https://doi.org/10.1007/s00493-014-3059-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-014-3059-6