The maximum number of cliques in graphs with bounded odd circumference

DOI10.1007/s00026-023-00682-yMaRDI QIDQ6644273

Zequn Lv, Zhen He, Nika Salia, Xiutao Zhu, Ervin Győri, Chuanqi Xiao

Publication date: 27 November 2024

Published in: Annals of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

spectral radiusRamsey theoryTurán problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Ramsey theory (05D10)

Cites Work

• Title not available (Why is that?)
• The maximum number of cliques in graphs without long cycles
• On maximal paths and circuits of graphs
• Extensions of the Erdős–Gallai theorem and Luo’s theorem
• Eigenvalues and cycles of consecutive lengths
• Stability version of Dirac's theorem and its applications for generalized Turán problems
• Exact results on generalized Erdős-Gallai problems

This page was built for publication: The maximum number of cliques in graphs with bounded odd circumference

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