Pages that link to "Item:Q2723463"
From MaRDI portal
The following pages link to A sharp bound on the size of a connected matroid (Q2723463):
Displaying 18 items.
- Inequivalent representations of matroids over prime fields (Q394760) (← links)
- Capturing matroid elements in unavoidable 3-connected minors (Q427796) (← links)
- An Erdős-Gallai theorem for matroids (Q434226) (← links)
- Paths in circuit graphs of matroids (Q924155) (← links)
- On cocircuit covers of bicircular matroids (Q932659) (← links)
- Relations between the circumference and \(e\)-circumference of a matroid (Q937245) (← links)
- The 3-connected matroids with circumference 6 (Q965999) (← links)
- Circuit and fractional circuit covers of matroids (Q976155) (← links)
- The 3-connected binary matroids with circumference 6 or 7 (Q1041600) (← links)
- How big can the circuits of a bridge of a maximal circuit be? (Q1117943) (← links)
- Connected matroids with a small circumference (Q1861209) (← links)
- Branch-depth: generalizing tree-depth of graphs (Q2225398) (← links)
- Special issue in honour of James Oxley (Q2343462) (← links)
- Families of matroids induced by classes of graphs (Q2568112) (← links)
- Circuits through cocircuits in a graph with extensions to matroids (Q2568499) (← links)
- Matroid packing and covering with circuits through an element (Q2581505) (← links)
- Large \(W_k\)- or \(K_{3,t}\)-minors in 3-connected graphs (Q2811204) (← links)
- Unavoidable connected matroids retaining a specified minor (Q2818205) (← links)