Erdos-Hajnal conjecture for graphs with bounded VC-dimension
From MaRDI portal
Publication:4580118
DOI10.4230/LIPIcs.SoCG.2017.43zbMath1432.05065arXiv1710.03745OpenAlexW2920461028MaRDI QIDQ4580118
Jacob Fox, Andrew Suk, János Pach
Publication date: 13 August 2018
Full work available at URL: https://arxiv.org/abs/1710.03745
Generalized Ramsey theory (05C55) Erd?s problems and related topics of discrete geometry (52C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Ramsey theory (05D10)
Related Items (4)
Caterpillars in Erdős-Hajnal ⋮ The removal lemma for tournaments ⋮ Conflict-free coloring of intersection graphs of geometric objects ⋮ On low rank-width colorings
This page was built for publication: Erdos-Hajnal conjecture for graphs with bounded VC-dimension
