All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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%2F67985807%3A_____%2F23%3A00581988" target="_blank" >RIV/67985807:_____/23:00581988 - 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

    <a href="/en/project/GA19-08740S" target="_blank" >GA19-08740S: Embedding, Packing and Limits in Graphs</a><br>

  • 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

    EUROCOMB’23. Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications

  • ISBN

  • ISSN

    2788-3116

  • e-ISSN

    2788-3116

  • Number of pages

    8

  • Pages from-to

    328-335

  • Publisher name

    MUNI Press

  • Place of publication

    Brno

  • Event location

    Prague

  • Event date

    Aug 28, 2023

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article