Stability and exact Turán numbers for matroids

DOI10.1016/j.jctb.2019.11.004zbMath1437.05040arXiv1710.03815OpenAlexW2992786313MaRDI QIDQ2173427

Yanyan Li

Publication date: 22 April 2020

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

regularitylinear formsmatroidsextremal combinatoricsTurán numbersarithmetic combinatorics

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of finite geometries (05B25) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• A geometric version of the Andrásfai-Erdős-Sós theorem
• An analogue of the Erdős-Stone theorem for finite geometries
• The classification of the smallest nontrivial blocking sets in \(PG(n,2)\)
• The critical number of dense triangle-free binary matroids
• Size functions of subgeometry-closed classes of representable combinatorial geometries
• Odd circuits in dense binary matroids
• Dense binary \(\mathrm{PG}(t-1,2)\)-free matroids have critical number \(t-1\) or \(t\)
• Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
• A counting lemma for binary matroids and applications to extremal problems
• Every locally characterized affine-invariant property is testable
• A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
• The true complexity of a system of linear equations
• General systems of linear forms: equidistribution and true complexity
• Unnamed Item
• Unnamed Item

This page was built for publication: Stability and exact Turán numbers for matroids