Matroids with every two elements in a 4-circuit.

MaRDI QIDQ2936662zbMATH OpenFDO

Authors Deborah Chun

Publication date 6 January 2015

zbMATH Keywords

graphic matroidrank \(r\)-binary matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Paths and cycles (05C38)

Recommendations

• A circuit characterization of graphic matroids
• On large circuits in matroids
• Adjacency in binary matroids
• On matroids with few circuits containing a pair of elements
• Intersections of circuits and cocircuits in binary matroids

Cited in

(11)

• Adjacency in binary matroids
• Intersections of circuits and cocircuits in binary matroids
• An extension of elementary bipartite graphs to matroid pairs and its characterization
• On pancyclic representable matroids
• NOTE ON THE LENGTH OF ELEMENTARY CYCLES OF A GRAPH
• THE LONG-LINE GRAPH OF A COMBINATORIAL GEOMETRY. I. EXCLUDING M(K₄) AND THE (q + 2)-POINT LINE AS MINORS
• scientific article; zbMATH DE number 1168010 (Why is no real title available?)
• Partitions of points into simplices with k-dimensional intersection. II: Proof of Reay's conjecture in dimensions 4 and 5
• On bipartite restrictions of binary matroids
• Equivalent factor matroids of graphs
• On matroids with few circuits containing a pair of elements

This page was built for publication: Matroids with every two elements in a 4-circuit.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936662)