Keywords
- Graph Theory
- Bipartite Graph
- Extremal Problem
- Discrete Math
- Chromatic Number
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
P. Turán, Eine extremalaufgabe aus der Graphentheorie (in Hungarian). Mat és Fiz Lapok 48 (1941), 436–452 see also Colloquium Math. 3 (1954), 19–30.
G. Katona, T. Nemetz and M. Simonovits, On a graph problem of P. Turán, Mat. Lapok 15 (1964), 228–238 (in Hungarian). See also Y. Spencer, Turáns theorem for k-graphs, Discrete Math. 2 (1972), 183–186.
P. Erdös, Extremal problems in graph theory, Theory of graphs and its applications, Proc. Symp. held at Smolenice, June, 1963, Publishing House of Czechoslovak Academy and Academic Press, 29–36.
P. Erdös and A. H. Stone, On the structure of linear graphs, Bull. Amer. Math. Soc. 52 (1946), 1087–1091, P. Erdös and M. Simonovits, A Limit theorem in graph theory, Studia Sci. Mat. Hung. Acad. 1 (1966), 51–57.
T. Kövári, V. T. Sós and P. Turán, On a problem of K. Zarankiewicz, Colloquium Math. 3 (1954), 50–57.
W. G. Brown, On graphs that do not contain a Thomsen graph, Canad. Math. Bull 9 (1966), 281–285, P. Erdös, A. Rényi and V. T. Sós, On a problem of graph theory, Studia Sci. Math. Hung. Acad. 1 (1966), 215–235.
J. A. Bondy, Large cycles in graphs, Discrete Math. 1(1971), 121–132. also Panyclic graphs I, J. Combinatorial Theory 11 (1971), 80–84, II will appear soon. D. R. Woodall, Sufficient conditions for circuits in graphs, Proc. London Math. Soc. 24 (1972), 739–755.
P. Erdös and T. Gallai, On the maximal paths and circuits of graphs, Acta. Math. Hung. Acad. Sci. 10(1959), 337–356, for some sharper results see B. Andrásfai, On the paths circuits and loops of graphs, Mat. Lapok 13 (1962) (in Hungarian).
P. Erdös and M. Simonovits, Some extremal problems in graph theory, Combinatorial Theory and its applications, Colloquium held in Balatonfüred, Hungary 1969, North Holland Publishing Company 1970, 377–390.
P. Erdös and M. Simonovits, An extremal graph problem, Acta. Math. Acad. Sci. Hungar. 22 (1971), 275–282.
P. Erdös, On some extremal problems in graph theory, Israel J. Math. 3(1965), 113–116. For further papers on extremal problems on graphs see P. Erdös, On some near inequalities concerning extremal properties of graphs, and M. Simonovits, A method for solving extremal problems in graph theory, Stability problems. Theory of Graphs Proc. Coll. Tihany, Hungary, 1966, Acad. Press 77–81 and 279–319.
P. Erdös, On extremal problems of graphs and generalized graphs, Israel J. Math. 2(1964), 183–190, see also ibid 251–261.
P. Erdös, On some extremal properties of r-graphs, Discrete Math. 1(1971), 1–6.
W. G. Brown, P. Erdös and V. T. Sós, On the existence of triangulated spheres in 3-graphs, and related problems, will appear soon.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1974 Springer-Verlag
About this paper
Cite this paper
Erdös, P. (1974). Extremal problems on graphs and hypergraphs. In: Berge, C., Ray-Chaudhuri, D. (eds) Hypergraph Seminar. Lecture Notes in Mathematics, vol 411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066181
Download citation
DOI: https://doi.org/10.1007/BFb0066181
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06846-4
Online ISBN: 978-3-540-37803-7
eBook Packages: Springer Book Archive
