Maximizing the number of cliques in graphs with given matching number

DOI10.1016/j.dam.2020.08.001zbMath1448.05104OpenAlexW3080340656MaRDI QIDQ2004083

Weihua Yang, Xing Peng, Xiuzhuan Duan, Jian Wang, Bo Ning

Publication date: 14 October 2020

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

Full work available at URL: https://doi.org/10.1016/j.dam.2020.08.001

zbMATH Keywords

stabilitymatchingsclosure

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

The Turán number of Berge-matching in hypergraphs ⋮ The Turán number of Berge hypergraphs with stable properties ⋮ Some sufficient conditions for graphs being \(k\)-leaf-connected ⋮ The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number ⋮ The zero forcing number of graphs with the matching number and the cyclomatic number ⋮ Families with restricted matching number and multiply covered shadows ⋮ Turán problems for Berge-\((k, p)\)-fan hypergraph ⋮ Further results on the generalized Turán number of spanning linear forests

Cites Work

• Unnamed Item
• Unnamed Item
• Stability in the Erdős-Gallai theorems on cycles and paths
• Stability results on the circumference of a graph
• Degrees and matchings
• A method in graph theory
• The maximum number of cliques in graphs without long cycles
• Stability in the Erdős-Gallai theorem on cycles and paths. II
• A variation of a theorem by Pósa
• Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
• On maximal paths and circuits of graphs
• Extensions of a theorem of Erdős on nonhamiltonian graphs
• Extensions of the Erdős–Gallai theorem and Luo’s theorem

This page was built for publication: Maximizing the number of cliques in graphs with given matching number