Beyond the Erdős–Sós conjecture
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F23%3A00375160" target="_blank" >RIV/68407700:21240/23:00375160 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-045" target="_blank" >https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-045</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.5817/CZ.MUNI.EUROCOMB23-045" target="_blank" >10.5817/CZ.MUNI.EUROCOMB23-045</a>
Alternative languages
Result language
angličtina
Original language name
Beyond the Erdős–Sós conjecture
Original language description
We prove an asymptotic version of a tree-containment conjecture of Klimošová, Piguet and Rozhoň [European J. Combin. 88 (2020), 103106] for graphs with quadratically many edges. The result implies that the asymptotic version of the Erdős-Sós conjecture in the setting of dense graphs is correct.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications
ISBN
978-80-280-0344-9
ISSN
2788-3116
e-ISSN
2788-3116
Number of pages
8
Pages from-to
328-335
Publisher name
Masarykova univerzita
Place of publication
Brno
Event location
Praha
Event date
Aug 28, 2023
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—