On a matroid generalization of graph connectivity

DOI10.1017/S0305004100058667zbMath0473.05020MaRDI QIDQ3927265

James G. Oxley

Publication date: 1981

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

zbMATH Keywords

n-connected matroidn-connected graph

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Related Items

Fork-decompositions of matroids ⋮ On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids ⋮ On Random Representable Matroids ⋮ Some Local Extremal Connectivity Results for Matroids ⋮ On 3-connected matroids ⋮ On contractible and vertically contractible elements in 3-connected matroids and graphs ⋮ Matroids with many common bases. ⋮ Matroids with few non-common bases ⋮ On matroid connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• Matroid representation over GF(3)
• Packing and covering with matroid circuits
• Theorems on matroid connectivity
• Extremal critically connected matroids
• Connectivity in Matroids