Abstract
Denote byG(n; m) a graph ofn vertices andm edges. We prove that everyG(n; [n 2/4]+1) contains a circuit ofl edges for every 3 ≦l<c 2 n, also that everyG(n; [n 2/4]+1) contains ak e(u n, un) withu n=[c 1 logn] (for the definition ofk e(u n, un) see the introduction). Finally fort>t 0 everyG(n; [tn 3/2]) contains a circuit of 2l edges for 2≦l<c 3 t 2.
Similar content being viewed by others
References
Turán, P., 1941,Mat. Lapok,48, 436–452 (Hungarian), see also Turan, P., 1955, On the theory of graphs,Coll. Math.,3, 19–30.
Dirac, G., will appear inActa Math. Acad. Sci. Hungar
Erdös, P., 1947, Some remarks on the theory of graphs,Bull. Amer, Math. Soc.,53, 292–294; see also Erdös, P. and Renyi, A., 1960, On the evolution of random graphs,Publ. Math. Inst. Hung. Acad,5, 17–61.
Erdös, P. and Stone, A. H., 1946, On the structure of linear graphs,Bull. Amer. Math. Soc.,52, 1087–1091.
Erdös, P., 1938, On sequences of integers no one of which divides the product of two others and on some related problems,Izv. Nauk. Inst. Mat. Mech. Tomsk.,2, 74–82.
Erdös, P., 1962, On the theorem of Rademacher-Turán,Illinois J. of Math.,6, 122–127.
Erdös, P. and Gallai, T., 1959, On maximal paths and circuits of graphs,Acta. Math. Acad. Sci. Hungar.,10, 337–356.
Author information
Authors and Affiliations
Additional information
This work was done while the author received support from the National Science Foundation, N.S.F. G.88.
Rights and permissions
About this article
Cite this article
Erdös, P. On the structure of linear graphs. Israel J. Math. 1, 156–160 (1963). https://doi.org/10.1007/BF02759702
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02759702