Abstract
The author proves that ifC is a sufficiently large constant then every graph ofn vertices and [Cn 3/2] edges contains a hexagonX 1,X 2,X 3,X 4,X 5,X 6 and a seventh vertexY joined toX 1,X 3 andX 5. The problem is left open whether our graph contains the edges of a cube, (i.e. an eight vertexZ joined toX 2,X 4 andX 6).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Erdörs,Extremal problems in graph theory, Proc. Symposium on Graph theory, Smolenice, Acad. C.S.S.R. (1963), 29–36.
P. Erdörs,On sequences of integers no one of which divides the product of two others and on some related problems, Irv. Inst. Math. i Mech. Tomsk,2 (1938), 79–82.
P. Erdös,On an extremal problem in graph theory, Coll. Math.13 (1965), 251–254.
P. Erdös,On the structure of linear graphs, In. J. Math.1 (1963), 156–160,see Lemma 1, p. 157–158.
P. Erdös and P. Gallai,On the maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hung.10 (1959), 337–357.
P. Turán,On the theory of graphs, Coll. Math.3 (1955), 19–30.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Erdös, P. On some extremal problems in graph theory. Israel J. Math. 3, 113–116 (1965). https://doi.org/10.1007/BF02760037
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02760037