Skip to search formSkip to main contentSkip to account menu

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.
Highly Cited
2016
Highly Cited
2016
2015
2015
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
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