Paper Info
Title
The Unbreakable Frame Matroids
Abstract
A connected matroid M is unbreakable if, for each of its flats F, the matroid M/F is connected or, equivalently, if M* has no two skew circuits. Pfeil showed that a simple graphic matroid M(G) is unbreakable exactly when G is either a cycle or a complete graph. We extend this result to describe which graphs are the underlying graphs of unbreakable frame matroids.
Year
DOI
Venue
2020
10.1137/19M126428X
SIAM JOURNAL ON DISCRETE MATHEMATICS
Keywords
DocType
Volume
bias matroid,frame matroid,skew circuits,unbreakable,balanced cycle
Journal
34
Issue
ISSN
Citations 
3
0895-4801
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Tara Fife100.34
Dillon Mayhew210218.63
James Oxley319424.39
Charles Semple443247.99