×
Faudree, R. J.; Simonovits, M.

On a class of degenerate extremal graph problems. (English) Zbl 0521.05037

Combinatorica 3, 83-93 (1983).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0521.05037

Cited in 2 Reviews
Cited in 52 Documents

MSC:

05C35 Extremal problems in graph theory

Keywords:

forbidden graphs; bipartite graph; theta graph
Cite Review PDF
Full Text: DOI

References:

[1] C. Benson, Minimal regular graphs of girth eight and twelve,Canad. J. Math. 18 (1966), 1091–1094. · Zbl 0146.45701 · doi:10.4153/CJM-1966-109-8
[2] B. Bollobás,Extremal Graph Theory, Academic Press, (1978) p. XVII.
[3] J. A. Bondy andM. Simonovits, Cycles of even length in graphs,J. Combin. Theory,16 B (1974), 97–105.
[4] W. G. Brown, On graphs that do not contain a Thomsen graph,Canad. Math. Bull. 9 (1966), 281–185. · Zbl 0178.27302 · doi:10.4153/CMB-1966-036-2
[5] W. G. Brown, P. Erdos andM. Simonovits, Extremal problems for directed graphs,J. Combin Theory,15/1B (1973), 77–93. · Zbl 0253.05124 · doi:10.1016/0095-8956(73)90034-8
[6] P. Erdos, Some Recent results on extremal problems in graph theory,Theory of Graphs, Intern. Symp. Rome, (1966), 118–123.
[7] P. Erdos, On some new inequalities concerning extremal properties of graphs,Theory of Graphs, Proc. Coll. Tihany (1966), 77–81.
[8] P. Erdos, On sequences of integers no one of which divides the product of two other related problems,Mitt. Forschunginst. Math. u. Mech. Tomsk 2 (1938), 74–82.
[9] P. Erdos, Problems and result in combinatorial analysis,Teorice Combinatorie Proc. Coll. Intern. Roma, settembre 1973.
[10] P. Erdos andA. Rényi, On the evolution of random graphs,Magyar Tud. Akad. Mat. Kut. Int. Kozl. 5 (1960), 17–61.
[11] P. Erdos, A. Rényi andV. T. Sós, On a problem of graph theory,Studia Sci. Math. Hungar. 1 (1966), 215–235.
[12] P. Erdos andM. Simonovits, A limit theorem in graph theory,Studia Sci. Math. Hungar. 1 (1966), 51–57.
[13] P. Erdos andM. Simonovits, Some extremal problems in graph theory,Coll. Math. Soc. J. Bolyai 4 (1969), 377–390.
[14] Hylten-Cavallius. On a combinatorial problem,Coll. Math. 6 (1958), 59–65. · Zbl 0086.01202
[15] T. Kovári, T. Sós andP. Turán, On a problem of Zarankiewicz,Coll. Math. 3 (1954), 50–57. · Zbl 0055.00704
[16] M. Simonovits, A method for solving extremal problems in graph theory,Theory of Graphs Proc. Coll. Tihany, (1966), 279–319.
[17] M. Simonovits, Paul Turán’s influence on graph theory,J. Graph Theory,2 (1977). · Zbl 0383.05023
[18] R. Singleton, On minimal graphs of maximum even girth,J. Combin. Theory,1 (1966), 306–332. · Zbl 0168.44703 · doi:10.1016/S0021-9800(66)80054-6
[19] P. Turán, On an extremal problem in graph theory,Mat. Fiz. Lapok 48 (1941), 436–452
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.