The solution to an extremal problem on balanced extensions of graphs
Authors:
- 1 July 1993
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 17 (3) , 417-431
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Countable sparse random graphsRandom Structures & Algorithms, 1990
- Balanced extensions of graphs and hypergraphsCombinatorica, 1988
- Graphes Équilibrés et Arboricité RationnelleEuropean Journal of Combinatorics, 1986
- Strongly balanced graphs and random graphsJournal of Graph Theory, 1986
- Every graph is contained in a sparsest possible balanced graphMathematical Proceedings of the Cambridge Philosophical Society, 1985
- Threshold functions for small subgraphsMathematical Proceedings of the Cambridge Philosophical Society, 1981