Maximizing the number of cliques in graphs with given matching number
type: Item
instance of: scholarly article
title: Maximizing the number of cliques in graphs with given matching number
zbMATH Open document ID: 1448.05104
author: Xiuzhuan Duan
author: Bo Ning
author: Xing Peng
author: Jian Wang
author: Weihua Yang
published in: Discrete Applied Mathematics
publication date: 2020-10-14T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 7260823
zbMATH Keywords: matchings
zbMATH Keywords: stability
zbMATH Keywords: closure
MaRDI profile type: Publication
full work available at URL: j.dam.2020.08.001
OpenAlex ID: W3080340656
cites work: A method in graph theory
cites work: Degrees and matchings
cites work: Q5722820
cites work: On maximal paths and circuits of graphs
cites work: Extensions of a theorem of Erdős on nonhamiltonian graphs
cites work: A variation of a theorem by Pósa
cites work: Stability in the Erdős-Gallai theorem on cycles and paths. II
cites work: Stability in the Erdős-Gallai theorems on cycles and paths
cites work: Q3852213
cites work: Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
cites work: The maximum number of cliques in graphs without long cycles
cites work: Stability results on the circumference of a graph
cites work: Extensions of the Erdős–Gallai theorem and Luo’s theorem
DOI: 10.1016/J.DAM.2020.08.001
description: scientific article; zbMATH DE number 7260823