The Number of Cliques in Graphs Covered by Long Cycles

DOI10.1137/22m1476046zbMath1516.05102arXiv2112.00070OpenAlexW4380361658MaRDI QIDQ6098464

No author found.

Publication date: 14 June 2023

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

Full work available at URL: https://arxiv.org/abs/2112.00070

zbMATH Keywords

cliquelong cycleErdős-Gallai theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Stability in the Erdős-Gallai theorems on cycles and paths
• Cycles in 2-connected graphs
• Long cycles and the codiameter of a graph. I
• The maximum number of cliques in graphs without long cycles
• Graphs with almost all edges in long cycles
• Subgraph coverings and edge switchings
• The codiameter of a 2-connected graph
• On maximal paths and circuits of graphs
• On graphs with randomly deleted edges
• Maximal circuits of graphs. I
• The History of Degenerate (Bipartite) Extremal Graph Problems

This page was built for publication: The Number of Cliques in Graphs Covered by Long Cycles