Every matroid is a submatroid of a uniformly dense matroid

DOI10.1016/0166-218X(94)00029-DzbMath0854.05027MaRDI QIDQ1902898

Hong-Jian Lai, Hongyuan Lai

Publication date: 13 January 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

matroidconnected graphextremal problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

The \(\kappa_k\)-connectivity of line graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• Every graph is contained in a sparsest possible balanced graph
• Strongly balanced graphs and random graphs
• Decomposition of Finite Graphs Into Forests