# Erdős–Gallai theorem

Known as: Erdos-Gallai theorem, Erdos–Gallai theorem, Erdős-Gallai theorem
The Erdős–Gallai theorem is a result in graph theory, a branch of combinatorial mathematics. It provides one of two known approaches solving the…
Wikipedia (opens in a new tab)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
• J. Comb. Theory, Ser. A
• 2017
• Corpus ID: 16924166
Highly Cited
2016
Highly Cited
2016
• Eur. J. Comb.
• 2016
• Corpus ID: 13214259
2015
2015
• Electron. Notes Discret. Math.
• 2015
• Corpus ID: 26919666
2012
2012
The \emph{graph realization problem} is to find for given nonnegative integers $a_1,\dots,a_n$ a simple graph (no loops or…
2008
2008
If m is a positive integer then we call a tree on at least 2 vertices an m-tree if no vertex is adjacent to more than m leaves…
2007
2007
• Discret. Math.
• 2007
• Corpus ID: 28194744
2007
2007
• J. Schmerl
• Discret. Comput. Geom.
• 2007
• Corpus ID: 44027687
Suppose n ≥ 2 and $X,Y \subseteq {\Bbb R}^n$ are such that X is infinite and Y is the set of vertices of an n-simplex. Then there…
2005
2005
• Discret. Math.
• 2005
• Corpus ID: 15870671
2000
2000
• Discret. Math.
• 2000
• Corpus ID: 39798073
1988
1988
• Discret. Math.
• 1988
• Corpus ID: 10684516