Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-16T22:24:12.088Z Has data issue: false hasContentIssue false
  • English
  • Français

A discrepancy version of the Hajnal–Szemerédi theorem

Part of: Graph theory

Published online by Cambridge University Press:  30 October 2020

József Balogh ,
Béla Csaba ,
András Pluhár  and
Andrew Treglown
József Balogh
Affiliation:
Department of Mathematics, University of Illinois at Urbana–Champaign, IL61801, USA, and Moscow Institute of Physics and Technology, Dolgoprudny, Russian Federation
Béla Csaba
Affiliation:
Bolyai Institute, University of Szeged, Hungary
András Pluhár
Affiliation:
Department of Computer Science, University of Szeged, Hungary
Andrew Treglown*
Affiliation:
University of Birmingham, Edgbaston, B15 2TT, UK
*
*Corresponding author. Email: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

A perfect Kr-tiling in a graph G is a collection of vertex-disjoint copies of the clique Kr in G covering every vertex of G. The famous Hajnal–Szemerédi theorem determines the minimum degree threshold for forcing a perfect Kr-tiling in a graph G. The notion of discrepancy appears in many branches of mathematics. In the graph setting, one assigns the edges of a graph G labels from {‒1, 1}, and one seeks substructures F of G that have ‘high’ discrepancy (i.e. the sum of the labels of the edges in F is far from 0). In this paper we determine the minimum degree threshold for a graph to contain a perfect Kr-tiling of high discrepancy.

MSC classification

Primary: 05C35: Extremal problems
Secondary: 05C70: Factorization, matching, partitioning, covering and packing
Type
Paper
Information
Combinatorics, Probability and Computing , Volume 30 , Issue 3 , May 2021 , pp. 444 - 459
Check for updates
Copyright
© The Author(s), 2020. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

†

Research of this author is partially supported by NSF grants DMS-1500121, DMS-1764123, Arnold O. Beckman Research Award (UIUC) Campus Research Board 18132 and the Langan Scholar Fund (UIUC).

‡

Research of this author was supported in part by the grant TUDFO/47138-1/2019-ITM of the Ministry for Innovation and Technology, Hungary, and by NKFIH grant KH_18 129597.

References

Alexander, J. R., Beck, J. and Chen, W. W. L. (1997) Geometric discrepancy theory and uniform distribution. In Handbook of Discrete and Computational Geometry (Goodman, J. E. et al., eds), pp. 331–357. CRC Press.Google Scholar
Alon, N. and Yuster, R. (1996) H-factors in dense graphs. J. Combin. Theory Ser. B 66 269–282.CrossRefGoogle Scholar
Balogh, J., Csaba, B., Jing, Y. and Pluhár, A. (2020) On the discrepancies of graphs. Electron. J. Combin. 27 P2.12.CrossRefGoogle Scholar
Beck, J. and Chen, W. W. L. (1987) Irregularities of Distribution, Vol. 89 of Cambridge Tracts in Mathematics. Cambridge University Press.Google Scholar
Bollobás, B. and Eldridge, S. E. (1978) Packing of graphs and applications to computational complexity. J. Combin. Theory Ser. B 25 105–124.CrossRefGoogle Scholar
Catlin, P. A. (1976) Embedding subgraphs and coloring graphs under extremal degree conditions. PhD thesis, Ohio State University, Columbus.Google Scholar
Chazelle, B. (2000) The Discrepancy Method. Cambridge University Press.CrossRefGoogle Scholar
Czygrinow, A., DeBiasio, L., Kierstead, H. A. and Molla, T. (2015) An extension of the Hajnal–Szemerédi theorem to directed graphs. Combin. Probab. Comput. 24 754–773.CrossRefGoogle Scholar
Czygrinow, A., DeBiasio, L., Molla, T. and Treglown, A. (2018) Tiling directed graphs with tournaments. Forum Math. Sigma 6 e2.CrossRefGoogle Scholar
Erdős, P., Füredi, Z., Loebl, M. and Sós, V. T. (1995) Discrepancy of trees. Stud. Sci. Math. 30 47–57.Google Scholar
Gishboliner, L., Krivelevich, M. and Michaeli, P. (2020) Colour-biased Hamilton cycles in random graphs. arXiv:2007.12111Google Scholar
Hajnal, A. and Szemerédi, E. (1970) Proof of a conjecture of P. Erdős. In Combinatorial Theory and its Applications, Vol. II, pp. 601–623. János Bolyai Mathematical Society.Google Scholar
Hell, P. and Kirkpatrick, D. G. (1983) On the complexity of general graph factor problems. SIAM J. Comput. 12 601–609.Google Scholar
Keevash, P. and Mycroft, R. (2015) A multipartite Hajnal–Szemerédi theorem. J. Combin. Theory Ser. B 114 187–236.CrossRefGoogle Scholar
Kierstead, H. A. and Kostochka, A. V. (2008) An Ore-type theorem on equitable coloring. J. Combin. Theory Ser. B 98 226–234.CrossRefGoogle Scholar
Komlós, J., Sárközy, G. N. and Szemerédi, E. (1997) Blow-up lemma. Combinatorica 17 109–123.CrossRefGoogle Scholar
Komlós, J., Sárközy, G. N. and Szemerédi, E. (1998) Proof of the Seymour conjecture for large graphs. Ann. Combin. 2 43–60.CrossRefGoogle Scholar
Komlós, J., Sárközy, G. N. and Szemerédi, E. (2001) Proof of the Alon–Yuster conjecture. Discrete Math. 235 255–269.CrossRefGoogle Scholar
Komlós, J. and Simonovits, M. (1996) Szemerédi’s Regularity Lemma and its applications in graph theory. In Combinatorics, Paul Erdős is Eighty, Vol. 2 (Miklós, D., Sós, V. T. and Szőnyi, T., eds), pp. 295–352. János Bolyai Mathematical Society.Google Scholar
Kühn, D. and Osthus, D. (2006) Critical chromatic number and the complexity of perfect packings in graphs. In 17th ACM–SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 851–859. ACM.Google Scholar
Kühn, D. and Osthus, D. (2009) The minimum degree threshold for perfect graph packings. Combinatorica 29 65–107.CrossRefGoogle Scholar
Sudakov, B. (2017) Robustness of graph properties. In Surveys in Combinatorics 2017, Vol. 440 of London Mathematical Society Lecture Note Series, pp. 372–408. Cambridge University Press.CrossRefGoogle Scholar
Szemerédi, E. (1978) Regular partitions of graphs. Problèmes Combinatoires et Théorie des Graphes Colloques Internationaux CNRS 260 399–401.Google Scholar
Treglown, A. (2016) A degree sequence Hajnal–Szemerédi theorem. J. Combin. Theory Ser. B 118 13–43.CrossRefGoogle Scholar