On maximal paths and circuits of graphs

P. Erdős; T. Gallai

doi:10.1007/bf02024498

journal article Sep 01, 1959

On maximal paths and circuits of graphs

P. Erdős T. Gallai

Acta Mathematica Academiae Scientiarum Hungaricae Vol. 10 No. 3-4 pp. 337-356 · Springer Science and Business Media LLC

View at Publisher Save 10.1007/bf02024498

Topics

No keywords indexed for this article. Browse by subject →

References

11

[1]

H. B. Belck, Reguläre Faktoren von Graphen,Journal f. reine u. angew. Math.,188 (1950), pp. 228–252. 10.1515/crll.1950.188.228

[2]

C. Berge,Theorie des graphes et ses applications (Paris, 1958).

[3]

G. A. Dirac, Some theorems on abstract graphs,Proc. London Math. Soc. (3),2 (1952), pp. 69–81. 10.1112/plms/s3-2.1.69

[4]

P. Erdős andA. H. Stone, On the structure of linear graphs,Bull. Amer. Math. Soc.,52 (1946), pp. 1087–1091. 10.1090/s0002-9904-1946-08715-7

[5]

T. Gallai, On factorisation of graphs,Acta Math. Acad. Sci. Hung.,1 (1950), pp. 133–153. 10.1007/bf02022560

[6]

D. König,Theorie der endlichen und unendlichen Graphen (Leipzig, 1936).

[7]

T. Kővári, Vera T. Sós andP. Turán, On a problem of K. Zarankiewicz,Colloquium Math.,3 (1954), pp. 50–57. 10.4064/cm-3-1-50-57

[8]

D. J. Newman, A problem in graph theory,Amer. Math. Monthly,65 (1958), p. 611. 10.2307/2309119

[9]

P. Turán, Egy gráfelméleti szélsőértékfeladatról,Mat. és Fiz. Lapok,48 (1941), pp. 436–452.

[10]

P. Turán, On the theory of graphs,Colloquium Math.,3 (1954), pp. 19–30. 10.4064/cm-3-1-19-30

[11]

K. Zarankiewicz, Sur les relations symétriques dans l'ensemble fini,Colloquium Math.,1 (1947), pp. 10–14. 10.4064/cm-1-1-10-14

Cited By

618

On generalized Turán number of graphs with bounded matching number

Yisai Xue, Liying Kang · 2025

Discrete Applied Mathematics

The number of edges in graphs with bounded clique number and circumference

Chunyang Dou, Bo Ning · 2025

Advances in Applied Mathematics

Extremal graphs without long paths and large cliques

Gyula O.H. Katona, Chuanqi Xiao · 2024

European Journal of Combinatorics

Exact results on generalized Erdős-Gallai problems

Debsoumya Chakraborti, Da Qi Chen · 2024

European Journal of Combinatorics

Extremal graphs without long paths and a given graph

Yichong Liu, Liying Kang · 2024

Discrete Mathematics

Extremal Problems for a Matching and Any Other Graph

Xiutao Zhu, Yaojun Chen · 2024

Journal of Graph Theory

Turán graphs with bounded matching number

Noga Alon, Peter Frankl · 2024

Journal of Combinatorial Theory, Se...

Spectral extrema of graphs with bounded clique number and matching number

Hongyu Wang, Xinmin Hou · 2023

Linear Algebra and its Applications

The maximum number of cliques in graphs with prescribed order, circumference and minimum degree

Leilei Zhang · 2023

European Journal of Combinatorics

On Turán problems with bounded matching number

Dániel Gerbner · 2023

Journal of Graph Theory

Spectral extrema of graphs with fixed size: Cycles and complete bipartite graphs

Mingqing Zhai, Huiqiu Lin · 2021

European Journal of Combinatorics

The shifting method and generalized Turán number of matchings

Jian Wang · 2020

European Journal of Combinatorics

The maximum number of cliques in graphs without long cycles

Ruth Luo · 2018

Journal of Combinatorial Theory, Se...

Many T copies in H-free graphs

Noga Alon, Clara Shikhelman · 2016

Journal of Combinatorial Theory, Se...

Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels

Noga Alon, Peter Frankl · 2012

Journal of Combinatorial Theory, Se...

Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees

Klas Markström, Andrzej Ruciński · 2011

European Journal of Combinatorics

Families of finite sets in which no set is covered by the union ofr others

P. Erdős, P. Frankl · 1985

Israel Journal of Mathematics

Maximal circuits of graphs. I

D. R. Woodall · 1976

Acta Mathematica Academiae Scientia...

Metrics

618

Citations

11

References

Details

Published: Sep 01, 1959
Vol/Issue: 10(3-4)
Pages: 337-356
License: View

Authors

Cite This Article

P. Erdős, T. Gallai (1959). On maximal paths and circuits of graphs. Acta Mathematica Academiae Scientiarum Hungaricae, 10(3-4), 337-356. https://doi.org/10.1007/bf02024498

On maximal paths and circuits of graphs

You May Also Like