A note on the stability results of the number of cliques in graphs with given matching number

DOI10.1016/j.dam.2024.05.039zbMATH Open1544.05086MaRDI QIDQ6585273

Long-Tu Yuan, Jiabao Yang

Publication date: 9 August 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

stabilitymatchingscliqueGallai-Edmonds theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability in the Erdős-Gallai theorems on cycles and paths
• Stability results on the circumference of a graph
• Matching theory
• The maximum number of cliques in graphs without long cycles
• Stability in the Erdős-Gallai theorem on cycles and paths. II
• Maximizing the number of cliques in graphs with given matching number
• The shifting method and generalized Turán number of matchings
• On maximal paths and circuits of graphs
• Paths, Trees, and Flowers
• A stability result of the Pósa lemma

This page was built for publication: A note on the stability results of the number of cliques in graphs with given matching number