Name
Abstract | ||
|---|---|---|
The Erd\H{o}s-S\'{o}s Conjecture states that if $G$ is a simple graph of order $n$ with average degree more than $k-2,$ then $G$ contains every tree of order $k$. In this paper, we prove that Erd\H{o}s-S\'{o}s Conjecture is true for $n=k+4$. |
Year | Venue | Field |
|---|---|---|
2017 | Ars Math. Contemp. | Topology,Discrete mathematics,Graph,abc conjecture,Combinatorics,Vertex (geometry),Lonely runner conjecture,Degree (graph theory),Collatz conjecture,Conjecture,Erdős–Gyárfás conjecture,Mathematics |
DocType | Volume | Issue |
Journal | 13 | 1 |
Citations | PageRank | References |
1 | 0.37 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| longtu yuan | 1 | 1 | 0.37 |
| Xiao-Dong Zhang | 2 | 97 | 19.87 |