Another extremal problem for Turan graphs
From MaRDI portal
Let K(G) and \(\omega\) (G) be the clique graph and clique number of a graph G. For \(1<r<n\), let \(F(n,r)=\max_{G}\{| K(G)|:| V(G)| =n\) and \(\omega (G)=r\}\). A Turan graph \(T(n,r)\) is a multipartite graph with vertices \(v_ 1,v_ 2,...,v_ n\), and \(v_ iv_ j\in E(G)\) if and only if \(i\neq j\) (mod r). Theorem: Let G be a graph of order n with \(\omega (G)=r<n\). Then \(| K(G)| =F(n,r)\) if and only if \(G\sim T(n,r)\).
Recommendations
Cites work
Cited in
(28)- Fibonacci index and stability number of graphs: a polyhedral study
- The maximum number of cliques in dense graphs
- Extremal graphs for intersecting cliques
- A Turán type problem concerning the powers of the degrees of a graph
- Maximizing the number of independent sets of fixed size in connected graphs with given independence number
- A new Turán-type theorem for cliques in graphs
- A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints
- Some extremal results on hypergraph Turán problems
- A path Turán problem for infinite graphs
- Convex hull of face vectors of colored complexes
- Joints in graphs
- A Turán-type problem on distances in graphs
- Turán problems for integer-weighted graphs
- scientific article; zbMATH DE number 4202285 (Why is no real title available?)
- scientific article; zbMATH DE number 3970790 (Why is no real title available?)
- scientific article; zbMATH DE number 1161246 (Why is no real title available?)
- The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs
- Independent sets in graphs
- ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE
- New Turán Exponents for Two Extremal Hypergraph Problems
- Turán Problems and Shadows III: Expansions of Graphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- An Extremal Property of Turán Graphs, II
- scientific article; zbMATH DE number 4189765 (Why is no real title available?)
- Maxima and minima of the Hosoya index and the Merrifield-Simmons index
- An extremal property of Turán graphs
- An extremal problem on v-partite graphs
- Enumeration of packed graphs
This page was built for publication: Another extremal problem for Turan graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1093651)
