The structure of claw-free binary matroids

DOI10.1016/j.jctb.2021.04.002zbMath1469.05027arXiv1807.11543OpenAlexW3159182979MaRDI QIDQ2040015

Yanyan Li

Publication date: 6 July 2021

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

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

zbMATH Keywords

decomposition theoremclaw-free matroids

Mathematics Subject Classification ID

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

Related Items (1)

The Structure of $I_4$-Free and Triangle-Free Binary Matroids

Cites Work

• An analogue of the Erdős-Stone theorem for finite geometries
• The critical number of dense triangle-free binary matroids
• A tight bound for Green's arithmetic triangle removal lemma in vector spaces
• A Szemerédi-type regularity lemma in abelian groups, with applications
• Green's sumset problem at density one half
• The Structure of Binary Matroids with no Induced Claw or Fano Plane Restriction
• A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The structure of claw-free binary matroids