A stability result of the Pósa lemma

DOI10.1137/20m1382143zbMATH Open1540.05084MaRDI QIDQ6552474

Jie Ma, Long-Tu Yuan

Publication date: 8 June 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

2-connected graphsErdős-Gallai stability theoremPósa lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability in the Erdős-Gallai theorems on cycles and paths
• Long cycles and the codiameter of a graph. I
• Stability results on the circumference of a graph
• The maximum number of cliques in graphs without long cycles
• Stability in the Erdős-Gallai theorem on cycles and paths. II
• On maximal paths and circuits of graphs
• The Number of Cliques in Graphs Covered by Long Cycles

Related Items (2)

A note on the stability results of the number of cliques in graphs with given matching number ⋮ Circumference, minimum degree and clique number

This page was built for publication: A stability result of the Pósa lemma