Another extremal problem for Turan graphs

DOI10.1016/0012-365X(87)90139-7zbMath0629.05041OpenAlexW2016908703MaRDI QIDQ1093651

Bruce A. Hedman

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0012-365x(87)90139-7

zbMATH Keywords

clique numberclique graphmultipartite graphTuran graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (7)

Maxima and minima of the Hosoya index and the Merrifield-Simmons index ⋮ Maximizing the number of independent sets of fixed size in connected graphs with given independence number ⋮ Enumeration of packed graphs ⋮ Independent sets in graphs ⋮ The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs ⋮ Fibonacci index and stability number of graphs: a polyhedral study ⋮ The maximum number of cliques in dense graphs

Cites Work

• The maximum number of cliques in dense graphs
• The maximum number of q-cliques in a graph with no p-clique
• On cliques in graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Another extremal problem for Turan graphs