Improved bounds for the Erdős-Rogers function

DOI10.19086/aic.12048zbMath1450.05054arXiv1804.11302OpenAlexW2798872097WikidataQ128340079 ScholiaQ128340079MaRDI QIDQ5126754

Oliver Janzer, Timothy Gowers

Publication date: 20 October 2020

Published in: Advances in Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.11302

zbMATH Keywords

Ramsey theory

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (3)

Quasiplanar graphs, string graphs, and the Erdős-Gallai problem ⋮ The asymptotics of \(r(4,t)\) ⋮ On the Stability of the Graph Independence Number

This page was built for publication: Improved bounds for the Erdős-Rogers function