Joints in graphs

DOI10.1016/j.disc.2007.03.045zbMath1131.05049OpenAlexW2093993157MaRDI QIDQ2463464

Vladimir Nikiforov, Béla Bollobás

Publication date: 12 December 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.03.045

zbMATH Keywords

stabilitycliqueTurán graphextremal graphjoint

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (8)

Degree Powers in Graphs: The Erdős–Stone Theorem ⋮ Books Versus triangles ⋮ Large joints in graphs ⋮ Extremal problems for the \(p\)-spectral radius of graphs ⋮ Ramsey non-goodness involving books ⋮ Short proofs of some extremal results III ⋮ Turán's theorem inverted ⋮ A Density Turán Theorem

Cites Work

• On the connection between chromatic number, maximal clique and minimal degree of a graph
• 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: Joints in graphs