Maximizing the number of cliques in graphs with given matching number

DOI10.1016/J.DAM.2020.08.001MaRDI QIDQ2004083zbMATH OpenOpenAlexFDO

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

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

stabilityclosurematchings

Mathematics Subject Classification ID

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

Recommendations

• On the maximum number of edges in hypergraphs with fixed matching and clique number
• Factorially many maximum matchings close to the Erdős-Gallai bound
• Generalization of Erdős-Gallai edge bound
• On the Hosoya index and the Merrifield-Simmons index of graphs with a given clique number
• Further results on the generalized Turán number of spanning linear forests

Cites work

• scientific article; zbMATH DE number 3652374 (Why is no real title available?)
• scientific article; zbMATH DE number 3186566 (Why is no real title available?)
• A method in graph theory
• A variation of a theorem by Pósa
• Degrees and matchings
• Extensions of a theorem of Erdős on nonhamiltonian graphs
• Extensions of the Erdős-Gallai theorem and Luo's theorem
• On maximal paths and circuits of graphs
• Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
• Stability in the Erdős-Gallai theorem on cycles and paths. II
• Stability in the Erdős-Gallai theorems on cycles and paths
• Stability results on the circumference of a graph
• The maximum number of cliques in graphs without long cycles

Cited in

(17)

• Turán problems for Berge-\((k, p)\)-fan hypergraph
• The Turán number of Berge-matching in hypergraphs
• The zero forcing number of graphs with the matching number and the cyclomatic number
• A note on the stability results of the number of cliques in graphs with given matching number
• On a problem of Ahlswede and Katona
• Further results on the generalized Turán number of spanning linear forests
• Families with restricted matching number and multiply covered shadows
• The Turán number of Berge hypergraphs with stable properties
• Some sufficient conditions for graphs being \(k\)-leaf-connected
• The maximum number of 3- and 4-cliques within a planar maximally filtered graph
• Turán graphs with bounded matching number
• The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number
• Generalization of Erdős-Gallai edge bound
• On the maximum number of edges in hypergraphs with fixed matching and clique number
• scientific article; zbMATH DE number 3933899 (Why is no real title available?)
• Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width
• scientific article; zbMATH DE number 1500539 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2004083)