Original title: Beyond the Erdős–Sós conjecture
Authors: Davoodi, Akbar ; Piguet, Diana ; Řada, Hanka ; Sanhueza-Matamala, N.
Document type: Papers
Conference/Event: EUROCOMB 2023: European Conference on Combinatorics, Graph Theory and Applications /12./, Prague (CZ), 20230828
Year: 2023
Language: eng
Abstract: 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.
Keywords: conjecture; Erdős-Sós conjecture
Project no.: GA19-08740S (CEP)
Funding provider: GA ČR
Host item entry: EUROCOMB’23. Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications
Note: Související webová stránka: https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-045

Institution: Institute of Computer Science AS ČR (web)
Document availability information: Fulltext is available in the digital repository of the Academy of Sciences.
Original record: https://hdl.handle.net/11104/0350124

Permalink: http://www.nusl.cz/ntk/nusl-539250


The record appears in these collections:
Research > Institutes ASCR > Institute of Computer Science
Conference materials > Papers