Everything about Discrepancy of hypergraphs

🧭 Start here: a 6-step reading path

1. Read the overview: Discrepancy of hypergraphsA 5-minute orientation
2. Pick up a classic book: Experimental AlgorithmsThe most-reprinted book on the subject
3. Read the landmark paper: Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphsCited 40 times
4. Go sideways: Expander mixing lemmaA closely related topic
5. Go sideways: Continuous functional calculusA closely related topic

🏆 Landmark papers (most cited)

• Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs

  József Balogh, Danila Cherkashin, Sergei Kiselev · 2019 · European Journal of Combinatorics · 40 citations

• On small n-uniform hypergraphs with positive discrepancy

  Danila Cherkashin, Fedor Petrov · 2019 · Journal of Combinatorial Theory, Series B · 14 citations

• Discrepancy and signed domination in graphs and hypergraphs

  A. Poghosyan, V. Zverovich · 2010 · Discrete Mathematics · 5 citations

• Discrepancy of random graphs and hypergraphs

  Jie Ma, Humberto Naves, Benny Sudakov · 2013 · Random Structures & Algorithms · 3 citations

• Bisection width, discrepancy, and eigenvalues of hypergraphs

  Eero Räty, István Tomon · 2026 · Journal of Combinatorial Theory, Series B · 3 citations

• The Phase Transition of Discrepancy in Random Hypergraphs

  Calum MacRury, Tomáš Masařík, Leilani Pai · 2023 · SIAM Journal on Discrete Mathematics · 3 citations

• Random unconditional convergence of Rademacher chaos in $$L_\infty $$ and sharp estimates for discrepancy of weighted graphs and hypergraphs

  Sergey V. Astashkin, Konstantin V. Lykov · 2025 · Mathematische Annalen · 2 citations

• Discrepancy of Symmetric Products of Hypergraphs

  Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus · 2006 · The Electronic Journal of Combinatorics · 1 citations

📚 Books worth reading

• Experimental AlgorithmsVincenzo Bonifaci · 2013

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Expander mixing lemma The expander mixing lemma intuitively states that the edges of certain d {\displaystyle d} -regular graphs are evenly distributed throughout the graph…
• Continuous functional calculus In mathematics, particularly in operator theory and C*-algebra theory, the continuous functional calculus is a functional calculus which allows the application…
• Noncentral chi-squared distribution In probability theory and statistics, the noncentral chi-squared distribution (or noncentral chi-square distribution, noncentral χ 2 {\displaystyle \chi…
• Conway–Maxwell–Poisson distribution In probability theory and statistics, the Conway–Maxwell–Poisson (CMP or COM–Poisson) distribution is a discrete probability distribution named after Richard…
• Hafnian In mathematics, the hafnian is a scalar function of a symmetric matrix that generalizes the permanent. The hafnian was named by Eduardo R. Caianiello "to…
• Classical capacity In quantum information theory, the classical capacity of a quantum channel is the maximum rate at which classical data can be sent over it error-free in…
• Quot scheme In algebraic geometry, the Quot scheme is a scheme parametrizing sheaves on a projective scheme. More specifically, if X is a projective scheme over a…
• Supermultiplet In theoretical physics, a supermultiplet is a representation of a supersymmetry algebra, possibly with extended supersymmetry. Then a superfield is a field…