The generalized Turán problem of two intersecting cliques

DOI10.7151/DMGT.2544MaRDI QIDQ6985852zbMATH OpenFDO

Authors Erica L. L. Liu, Jian Wang

Publication date 12 May 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2544

zbMATH Keywords

Füredi's structure theoremgeneralized Turán numberZykov's symmetrization

Mathematics Subject Classification ID

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

Cites work

• A new proof of the graph removal lemma
• Extremal problems for finite sets
• Forbidding just one intersection
• Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques
• Generalized Tur\'an results for disjoint cliques
• Generalized Turán numbers for the edge blow-up of a graph
• Generalized Turán results for intersecting cliques
• scientific article; zbMATH DE number 3523543 (Why is no real title available?)
• scientific article; zbMATH DE number 3609704 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• scientific article; zbMATH DE number 3050594 (Why is no real title available?)
• Intersection Properties of Systems of Finite Sets
• Many \(T\) copies in \(H\)-free graphs
• Maximum cliques in a graph without disjoint given subgraph
• On finite set-systems whose every intersection is a kernel of a star
• On generalized Turán number of two disjoint cliques
• The maximum number of triangles in \(F_k\)-free graphs
• Vraagstuk XXVIII.

Cited in

(2)

• Generalized Turán problems for disjoint even wheels, and for disjoint bowties
• A generalized Turán extension of the Deza-Erdős-Frankl theorem

This page was built for publication: The generalized Turán problem of two intersecting cliques

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