Guido Besomi

Guido Besomi
University of Chile

About

6
Publications
418
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
15
Citations

Publications

Publications (6)
Article
We prove the Erdős–Sós conjecture for trees with bounded maximum degree and large dense host graphs. As a corollary, we obtain an upper bound on the multicolour Ramsey number of large trees whose maximum degree is bounded by a constant.
Preprint
Full-text available
We prove the Erd\H os--S\'os conjecture for trees with bounded maximum degree and large dense host graphs.
Preprint
Full-text available
We propose the following conjecture: For every fixed $\alpha\in [0,\frac 12]$, each graph of minimum degree at least $(1+\alpha)\frac k2$ and maximum degree at least $2(1-\alpha)k$ contains each tree with $k$ edges as a subgraph. \\ Our main result is an approximate version of the conjecture for bounded degree trees and large dense host graphs. We...
Article
Full-text available
We conjecture that every n-vertex graph of minimum degree at least k 2 and maximum degree at least 2k contains all trees with k edges as subgraphs. We prove an approximate version of this conjecture for trees of bounded degree and dense host graphs. Our work also has implications on the Erd˝ os-Sós conjecture and the 2 3-conjecture. We prove an app...
Preprint
We conjecture that every $n$-vertex graph of minimum degree at least $\frac k2$ and maximum degree at least $2k$ contains all trees with $k$ edges as subgraphs. We prove an approximate version of this conjecture for trees of bounded degree and dense host graphs. Our work also has implications on the Erd\H os--S\'os conjecture and the $\frac 23$-con...

Network