Turán's theorem

Known as: Mantel theorem, Turan's Theorem, Mantel (disambiguation) 
In graph theory, Turán's theorem is a result on the number of edges in a Kr+1-free graph. An n-vertex graph that does not contain any (r + 1)-vertex… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Article history: Received 18 October 2012 Available online 27 August 2013 Let K3 3,3 be the 3-graph with 15 vertices {xi, yi : 1… (More)
  • figure 1
Is this relevant?
2010
2010
Let r ≥ 2 and write K+ r (s1, . . . , sr) for the complete r-partite graph with parts of size s1 ≥ 2, . . . , sr with an edge… (More)
Is this relevant?
2009
2009
Let μ (G) be the largest eigenvalue of a graph G and Tr (n) be the r-partite Turán graph of order n. We prove that if G is a… (More)
Is this relevant?
2008
2008
The minimum size of a k-connected graph with given order and stability number is investigated. If no connectivity is required… (More)
  • figure 1
  • figure 2
Is this relevant?
2008
2008
3 A function f : V (G) → {+1,−1} defined on the vertices of a graph G is a signed domi4 nating function if for any vertex v the… (More)
  • figure 1
Is this relevant?
2007
2007
The generalized Turán number ex(G,H) of two graphs G and H is the maximum number of edges in a subgraph of G not containing H… (More)
Is this relevant?
2006
2006
Fix l ≥ r ≥ 2. Let H l+1 be the r-uniform hypergraph obtained from the complete graph Kl+1 by enlarging each edge with a new set… (More)
Is this relevant?
2005
2005
In this paper, we obtain an asymptotic generalization of Turán’s theorem. We prove that if all the non-trivial eigenvalues of a d… (More)
Is this relevant?
2004
2004
The aim of this paper is to prove a Turán type theorem for random graphs. For 0 < γ and graphs G and H, write G →γ H if any… (More)
  • figure 4.1
  • figure 4.2
Is this relevant?
2003
2003
We prove the analogue of Turán’s Theorem in random graphs with edge probability p(n) À n−1/(k−1.5). With probability 1 − o(1… (More)
Is this relevant?