Hostname: page-component-76fb5796d-5g6vh Total loading time: 0 Render date: 2024-04-27T05:34:35.489Z Has data issue: false hasContentIssue false
  • English
  • Français

Every graph is contained in a sparsest possible balanced graph

Published online by Cambridge University Press:  24 October 2008

E. Györi ,
B. Rothschild  and
A. Runciński
E. Györi
Affiliation:
Mathematical Institute, Hungarian Academy of Sciences, Budapest
B. Rothschild
Affiliation:
Department of Mathematics, University of California, Los Angeles
A. Runciński
Affiliation:
Institute of Mathematics, Adam Mickiewicz University, Poznań
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper we prove that, for any graph G, there exists a graph F such that G is a subgraph of F and

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 98 , Issue 3 , November 1985 , pp. 397 - 401
Copyright
Copyright © Cambridge Philosophical Society 1985

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Bollaobás, B.. Threshold functions for small subgraphs. Math. Proc. Cambridge Philos. Soc. 90 (1981), 197–206.CrossRefGoogle Scholar
[2]Erdös, P. and Rényi, A.. On the evolution of random graphs. Publ. Math. Inst. Hung. Acid. Sci. 5 (1960), 17–61.Google Scholar
[3]Karoński, M. and Ruciński, A.. Medium subgraphs of a random graph. Unpublished, 1981.Google Scholar
[4]Karoński, M. and Ruciński, A.. Problem 4. In Graphs and Other Combinatorial Topics, Proc. of the Third Czechoslovak Symp. on Graph Theory (Prague, 1982), p. 350.Google Scholar
[5]Palka, Z., Ruciński, A. and Spencer, J.. On a method for random graphs. Submitted to Discr. Math.)Google Scholar