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)

Related topics

Related topics

10 relations
Degree (graph theory)Flow networkFulkerson–Chen–Anstee theoremGale–Ryser theorem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The Erd\"os-S\'os Conjecture for Spiders
The Erd\"os-S\'os conjecture states that if $G$ is a graph with average degree more than $k-1$, then G contains every tree of $k… 
2015
2015
Tight Cycles in Hypergraphs
2014
2014
Tight cycles and regular slices in dense hypergraphs
2012
2012
The Connection between the Number of Realizations for Degree Sequences and Majorization
The \emph{graph realization problem} is to find for given nonnegative integers $a_1,\dots,a_n$ a simple graph (no loops or… 
Highly Cited
2010
Highly Cited
2010
Hypergraph extensions of the Erdős-Gallai Theorem
2008
2008
Packing Trees with Constraints on the Leaf Degree
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
The Erdös-Sós conjecture for spiders
2005
2005
A remark concerning graphical sequences
2000
2000
Solution to a problem on degree sequences of graphs
1988
1988
Gallai theorems for graphs, hypergraphs, and set systems
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)