Let L be a given family of so called prohibited graphs. Let ex (n, L) denote the maximum number of edges a simple graph of ordern can have without containing subgraphs from L. A typical extremal graph problem is to determine ex (n, L), or at least, find good bounds on it. Results asserting that for a given L there exists a much smaller L*⫅L for which ex (n, L) ≈ ex (n, L*) will be calledcompactness results. The main purpose of this paper is to prove some compactness results for the case when L consists of cycles. One of our main tools will be finding lower bounds on the number of pathsP k+1 in a graph ofn vertices andE edges., witch is, in fact, a “super-saturated” version of a wellknown theorem of Erdős and Gallai.
AMS subject classification (1980)05 C 35
Unable to display preview. Download preview PDF.
- W. G. Brown, P. Erdős andM. Simonovits, Algorithmic solution of extremal digraph problems,to be published.Google Scholar
- D. Cvetković, M. Doob andH. Sachs,Spectra of graphs — Theory and Application — VEB Deuthscher Verlag der Wissenschaften, Berlin, 1980.Google Scholar
- P. Erdős, On sequences of integers no one of which divides the product of two others, and some related problems,Mitt. Forschunginstitut Math. u. Mech. Tomsk 2 (1938) 74–82.Google Scholar
- P. Erdős, Graph theory and probability,Can J. Math. 11 (1959) 34–38.Google Scholar
- P. Erdős andM. Simonovits, Supersaturated graphs,submitted to Combinatorica.Google Scholar
- R. J. Faudree andM. Simonovits, On a class of degenerate extremal problems,submitted to Combinatorica.Google Scholar
- T. Kővári, V. T. Sós andP. Turán, On a problem of Zarankiewicz,Coll. Math. 3 (1954) (50–57).Google Scholar