We shall consider graphs (hypergraphs) without loops and multiple edges. Let ℒ be a family of so called prohibited graphs and ex (n, ℒ) denote the maximum number of edges (hyperedges) a graph (hypergraph) onn vertices can have without containing subgraphs from ℒ. A graph (hyper-graph) will be called supersaturated if it has more edges than ex (n, ℒ). IfG hasn vertices and ex (n, ℒ)+k edges (hyperedges), then it always contains prohibited subgraphs. The basic question investigated here is: At least how many copies ofL ε ℒ must occur in a graphG n onn vertices with ex (n, ℒ)+k edges (hyperedges)?
AMS subject classification (1980)05 C 35 05 C 65
Unable to display preview. Download preview PDF.
- B. Bollobás,Extremal graph theory, London Math. Soc. Monographs, No.11 Academic Press, 1978.Google Scholar
- B. Bollobás. Relations between sets of complete subgraphs,Proc. Fifth British Comb. Conference, Aberdeen, 1975, 79–84.Google Scholar
- P. Erdős, On the number of complete subgraphs contained in certain graphs,Publ. Math. Inst. Hungar. Acad. Sci. 7 (1962) 459–464.Google Scholar
- P. Erdős, On extremal problems of graphs and generalized graphs,Israel J. Math. 2 (1965) 183–190.Google Scholar
- P. Erdős, Some recent results on extremal problems in graph theory,Theory of Graphs, Intern. Symp. Rome, 1966, 118–123.Google Scholar
- P. Erdős. On some new inequalities concerning extremal properties of graphs,Theory of Graphs, Proc. Coll. Tihany, 1966, 77–81.Google Scholar
- P. Erdős andM. Simonovits, Some extremal problems in graph theory,Coll. Math. Soc. János Bolyai 4 (1969) 377–390.Google Scholar
- P. Erdős andA. H. Stone, On the structure of linear graphs, Bull. Amer. Math. Soc.52 (1946) 1089–1091.Google Scholar
- T. Kővári, V. T. Sós andP. Turán, On a problem of Zarankievicz,Coll. Math. 3 (1954) 50–57.Google Scholar
- L. Lovász andM. Simonovits, On the number of complete subgraphs of a graph,Proc. Fifth British Combinatorial Coll., Aberdeen, (1975) 431–442.Google Scholar
- L. Lovász andM. Simonovits, On the number of complete subgraphs of a graph, II.,Studies in Pure Mathematics, (1983), 459–495.Google Scholar
- M. Simonovits, A method for solving extremal problems in graph theory,in: Theory of Graphs, Proc. Coll. Tihany, Hungary, 1966, 279–319.Google Scholar