Remarks on a theorem of Erdős and Szemerédi
Abstract
Given a graph $G$ and a real $\varepsilon>0$, an edge-coloring of $G$ is called $\varepsilon$-balanced if each color appears on at least an $\varepsilon$-fraction of the edges in $G$. A classical result of Erdős and Szemerédi asserts that if a $2$-edge-coloring of a complete graph $K_n$ is not $\varepsilon$-balanced for some $0
Fields of Study & Subjects
Limits and Structures in Graph Theory
Advanced Combinatorial Mathematics
Advanced Topology and Set Theory
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 30 January 2026
- Document type
- Preprint