Large joints in graphs

DOI10.1016/j.ejc.2010.07.010zbMath1202.05066arXiv1001.2073OpenAlexW1977378525MaRDI QIDQ607362

Vladimir Nikiforov, Béla Bollobás

Publication date: 22 November 2010

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

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

zbMATH Keywords

number of cliquesTuran r-partite graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Short proofs of some extremal results III

Cites Work

• On a theorem of Rademacher-Turán
• Ramsey goodness and beyond
• Turán's theorem inverted
• Books in graphs
• Extremal graphs for intersecting triangles
• Joints in graphs
• Stability for large forbidden subgraphs
• On complete subgraphs of different orders
• On the number of complete subgraphs and circuits contained in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Large joints in graphs