Matroid fragility and relaxations of circuit hyperplanes

DOI10.1016/j.jctb.2019.08.007zbMath1436.05026arXiv1805.03263OpenAlexW2975620924MaRDI QIDQ1985443

Jim Geelen, Florian Hoersch

Publication date: 7 April 2020

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

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

zbMATH Keywords

Rota's conjecturecircuit-hyperplane relaxationmatroid fragility

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)

A method to construct all the paving matroids over a finite set

Cites Work

• Solving Rota's Conjecture
• Unnamed Item

This page was built for publication: Matroid fragility and relaxations of circuit hyperplanes