The critical number of dense triangle-free binary matroids
From MaRDI portal
Publication:896002
DOI10.1016/j.jctb.2015.08.003zbMath1327.05053arXiv1406.2588OpenAlexW1650378662MaRDI QIDQ896002
Publication date: 11 December 2015
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.2588
Related Items (6)
Stability and exact Turán numbers for matroids ⋮ The Structure of $I_4$-Free and Triangle-Free Binary Matroids ⋮ A counting lemma for binary matroids and applications to extremal problems ⋮ A matroid analogue of a theorem of Brooks for graphs ⋮ 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An analogue of the Erdős-Stone theorem for finite geometries
- An ergodic Szemerédi theorem for IP-systems and combinatorial theory
- A constructive approach to the critical problem for matroids
- On the chromatic number of triangle-free graphs of large minimum degree
- Size functions of subgeometry-closed classes of representable combinatorial geometries
- The chromatic thresholds of graphs
- On a valence problem in extremal graph theory
- A Szemerédi-type regularity lemma in abelian groups, with applications
- Dense graphs with small clique number
- Graph Theory and Probability
- ODD Cycles of Specified Length in Non-Bipartite Graphs
- On the structure of linear graphs
This page was built for publication: The critical number of dense triangle-free binary matroids
