On generalized Turán numbers of intersecting cliques

DOI10.1007/S00373-024-02876-4MaRDI QIDQ6661725

Xiaoli Yuan, Yuejian Peng

Publication date: 13 January 2025

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

generalized Turán numberintersecting cliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graphs with restricted valency and matching number
• Extremal graphs for intersecting cliques
• The maximum number of cliques in graphs without long cycles
• Extremal graphs for intersecting triangles
• Some sharp results on the generalized Turán numbers
• Maximizing five-cycles in \(K_r\)-free graphs
• Some exact results for generalized Turán problems
• Generalized Turán problems for even cycles
• Generalized Turán problems for disjoint copies of graphs
• Intersection theorems for systems of sets
• Eine Extremalaufgabe aus der Graphentheorie.
• Turán numbers of sunflowers
• Extremal Numbers for Odd Cycles
• Many \(T\) copies in \(H\)-free graphs
• Generalized Turán problems for double stars
• Generalized Turán results for intersecting cliques
• The maximum number of triangles in \(F_k\)-free graphs
• Every graph is eventually Turán-good

This page was built for publication: On generalized Turán numbers of intersecting cliques

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