An improved lower bound for Folkman's theorem
From MaRDI portal
Publication:5357107
DOI10.1112/blms.12058zbMath1375.05263arXiv1703.02473OpenAlexW3125275010MaRDI QIDQ5357107
Sean Eberhard, Andrew Treglown, Bhargav P. Narayanan, József Balogh, Adam Zsolt Wagner
Publication date: 13 September 2017
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.02473
Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (2)
Monochromatic Hilbert cubes and arithmetic progressions ⋮ Extremal problems in hypergraph colourings
This page was built for publication: An improved lower bound for Folkman's theorem