Every graph is contained in a sparsest possible balanced graph
From MaRDI portal
Publication:3705489
DOI10.1017/S030500410006360XzbMath0582.05048OpenAlexW2168083933MaRDI QIDQ3705489
No author found.
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
Related Items (4)
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 ⋮ Transforming a graph into a 1-balanced graph
This page was built for publication: Every graph is contained in a sparsest possible balanced graph
