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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

The famous Erdős-Gallai Theorem on the Turán number of paths states that every graph with n vertices and m edges contains a path…

2018

Let $$A_n=(a_1,a_2,\ldots ,a_n)$$An=(a1,a2,…,an) and $$B_n=(b_1,b_2,\ldots ,b_n)$$Bn=(b1,b2,…,bn) be nonnegative integer…

2016

We discuss two approaches to a recent question of Loh: must a 3-colored transitive tournament on $N$ vertices have a 1-color…

2012

The \emph{graph realization problem} is to find for given nonnegative integers $a_1,\dots,a_n$ a simple graph (no loops or…