论文信息 - The solution to an extremal problem on balanced extensions of graphs - 字舞流文

The solution to an extremal problem on balanced extensions of graphs

For n sufficiently large the order of a smallest balanced extension of a graph of order n is, in the worst case, ⌊(n + 3)2/8⌋. © 1993 John Wiley & Sons, Inc.

Andrzej Rucinski | Andrew Vince

[1] B. Rothschild,et al. Every graph is contained in a sparsest possible balanced graph , 1985, Mathematical Proceedings of the Cambridge Philosophical Society.

[2] C. Payan,et al. Equilibrium graphs and rational trees , 1986 .

[3] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.

[4] B. Bollobás. The evolution of random graphs , 1984 .

[5] M. Karonski,et al. On the number of strictly balanced subgraphs of a random graph , 1983 .

[6] P. Erdos,et al. On the evolution of random graphs , 1984 .

[7] A. Rucinski,et al. Balanced extensions of graphs and hypergraphs , 1988, Comb..

[8] B. Bollobás. Threshold functions for small subgraphs , 1981 .

[9] Andrzej Rucinski,et al. Strongly balanced graphs and random graphs , 1986, J. Graph Theory.

[10] Joel H. Spencer. Countable Sparse Random Graphs , 1990, Random Struct. Algorithms.