Stability results on the circumference of a graph

DOI10.1007/s00493-019-3843-4zbMath1449.05163arXiv1708.00704OpenAlexW3098406359WikidataQ126349608 ScholiaQ126349608MaRDI QIDQ783243

Jie Ma, Bo Ning

Publication date: 11 August 2020

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.00704

zbMATH Keywords

closure operationHamiltonian graphcliqueWoodall's conjecture2-connected graphedge-switching techniquegraph circumference

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Extremal combinatorics (05D99)

Related Items

The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number ⋮ Exact bipartite Turán numbers of large even cycles ⋮ Stability version of Dirac's theorem and its applications for generalized Turán problems ⋮ The maximum number of cliques in graphs with prescribed order, circumference and minimum degree ⋮ Non-Hamiltonian graphs with large minimum degree ⋮ Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph ⋮ Stability of Woodall's theorem and spectral conditions for large cycles ⋮ A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture ⋮ Maximizing the number of cliques in graphs with given matching number ⋮ Further results on the generalized Turán number of spanning linear forests

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability in the Erdős-Gallai theorems on cycles and paths
• Cycles in 2-connected graphs
• Long cycles and the codiameter of a graph. I
• Arc coverings of graphs
• On maximal circuits in directed graphs
• A method in graph theory
• On a closure concept in claw-free graphs
• Stability in the Erdős-Gallai theorem on cycles and paths. II
• Path Ramsey numbers in multicolorings
• A stability version for a theorem of Erdős on nonhamiltonian graphs
• On Hamilton's ideals
• Large cycles in graphs
• Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
• On maximal paths and circuits of graphs
• Maximal circuits of graphs. I
• Extensions of a theorem of Erdős on nonhamiltonian graphs
• The History of Degenerate (Bipartite) Extremal Graph Problems
• Some Theorems on Abstract Graphs