An analogue of the Erdős-Stone theorem for finite geometries

DOI10.1007/s00493-014-2952-3zbMath1374.05047arXiv1203.1911OpenAlexW2103315245MaRDI QIDQ520023

Yong-Cai Geng, Sumit K. Garg

Publication date: 31 March 2017

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

Hales-Jewett theoremfinite geometriesErdős-Stone theorem

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25)

Related Items (7)

Some heterochromatic theorems for matroids ⋮ Stability and exact Turán numbers for matroids ⋮ A counting lemma for binary matroids and applications to extremal problems ⋮ The critical number of dense triangle-free binary matroids ⋮ On vertex-induced weighted Turán problems ⋮ Dense binary \(\mathrm{PG}(t-1,2)\)-free matroids have critical number \(t-1\) or \(t\) ⋮ The structure of claw-free binary matroids

Cites Work

• Unnamed Item
• Unnamed Item
• A new proof of the density Hales-Jewett theorem
• An ergodic Szemerédi theorem for IP-systems and combinatorial theory
• Size functions of subgeometry-closed classes of representable combinatorial geometries
• A density version of the Hales-Jewett theorem
• A Simple Proof of the Density Hales–Jewett Theorem
• A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
• On the structure of linear graphs

This page was built for publication: An analogue of the Erdős-Stone theorem for finite geometries