Every graph is contained in a sparsest possible balanced graph

DOI10.1017/S030500410006360XMaRDI QIDQ3705489zbMATH OpenOpenAlexFDO

Authors

Publication date 1985

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

Full work available at URL https://doi.org/10.1017/s030500410006360x

zbMATH Keywords

balanced graphglobal degreelocal degree

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• On Graphs Which Contain All Sparse Graphs
• scientific article; zbMATH DE number 5543097
• Balanced graphs with minimum degree constraints
• Balanced graphs with edge density constraints
• scientific article; zbMATH DE number 125475
• scientific article; zbMATH DE number 125598
• scientific article; zbMATH DE number 54793
• On balanced graphs
• On the uniformly balancedness of graphs
• scientific article; zbMATH DE number 861312

Cited in

(8)

• Transforming a graph into a 1-balanced graph
• When are small subgraphs of a random graph normally distributed?
• Every matroid is a submatroid of a uniformly dense matroid
• Jumps in speeds of hereditary properties in finite relational languages
• scientific article; zbMATH DE number 15501 (Why is no real title available?)
• scientific article; zbMATH DE number 125475 (Why is no real title available?)
• The solution to an extremal problem on balanced extensions of graphs
• Balanced extensions of graphs and hypergraphs

This page was built for publication: Every graph is contained in a sparsest possible balanced graph

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