On a characterization of balanced matroids.

MaRDI QIDQ2716004zbMATH OpenFDO

Authors Jenifer Corp, Jennifer McNulty

Publication date 20 July 2005

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

balanced graph

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Random graphs (graph-theoretic aspects) (05C80)

Review text

A graph \(G\) is balanced if its density (average degree) is at least as large as the density of any subgraph of \(G\).NEWLINENEWLINE\textit{N. Veerapandiyan} and \textit{S. Arumugam} [Ars Comb.\ 32, 221-223 (1991; Zbl 0761.05080)] noted that \(G\) is balanced iff all components of \(G\) are balanced and their density equals that of \(G\). In the present note, an analogous result is verified for (loopless) matroids, where the density of a matroid \(M=(E, \mathcal F)\) is \(| M| /\rho (M)\), where \(\rho \) is the rank function.

Recommendations

• scientific article; zbMATH DE number 2060847
• scientific article; zbMATH DE number 1439501
• scientific article; zbMATH DE number 54793
• Two remarks concerning balanced matroids
• A new class of matroids

Cited in

(3)

• Every matroid is a submatroid of a uniformly dense matroid
• scientific article; zbMATH DE number 2060847 (Why is no real title available?)
• scientific article; zbMATH DE number 1439501 (Why is no real title available?)

This page was built for publication: On a characterization of balanced matroids.

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