Every graph is contained in a sparsest possible balanced graph
- 1 November 1985
- journal article
- Published by Cambridge University Press (CUP) in Mathematical Proceedings of the Cambridge Philosophical Society
- Vol. 98 (3) , 397-401
- https://doi.org/10.1017/s030500410006360x
Abstract
No abstract availableThis publication has 1 reference indexed in Scilit:
- Threshold functions for small subgraphsMathematical Proceedings of the Cambridge Philosophical Society, 1981