Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
András HajnalClaw-free graphClique (graph theory)Erdős–Stone theorem

Broader (1)

Extremal graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
A Density Corrádi–Hajnal Theorem
Abstract We find, for all sufficiently large $n$ and each $k$ , the maximum number of edges in an $n$ -vertex graph that does not… 
2005
2005
A generalization of Turán's theorem
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… 
Review
1999
Review
1999
Low-Molecular-Weight Heparins Compared with Unfractionated Heparin for Treatment of Acute Deep Venous Thrombosis
Low-molecular-weight heparins simplify the treatment of acute deep venous thrombosis because they may be administered… 
1999
1999
Dietary Characteristics of Eastern James Bay Cree Women
Food use and nutrient intake were studies with Cree women of Wemindji and Eastmain, Quebec. During summer 1994 and winter 1995… 
Highly Cited
1999
Highly Cited
1999
Vitamin D supplement in early childhood and risk for Type I (insulin-dependent) diabetes mellitus
Summary The initiation of the immunopathogenetic process that can lead to Type I (insulin-dependent) diabetes mellitus in… 
Highly Cited
1992
Highly Cited
1992
The Effect of Sample Size on the Functioning of the Mantel-Haenszel Statistic
The Mantel-Haenszel (MH) procedure has become one of the most popular procedures for detecting differential item functioning… 
1989
1989
On the variance estimator for the Mantel-Haenszel risk difference
Review
1988
Review
1988
Analysis of Differential Item Functioning in the NAEP History Assessment
The Mantel-Haenszel approach for investigating differential item functioning was applied to U.S. history items that were… 
Highly Cited
1981
Highly Cited
1981
On Turán’s theorem for sparse graphs
For a graphG withn vertices and average valencyt, Turán’s theorem yields the inequalityα≧n/(t+1) whereα denotes the maximum size… 
Highly Cited
1973
Highly Cited
1973
On a valence problem in extremal graph theory
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)