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”

The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars (Article No. R106)

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F08%3A00100025" target="_blank" >RIV/00216208:11320/08:00100025 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars (Article No. R106)

  • Original language description

    Loebl, Komlós, and Sós conjectured that if at least half the vertices of a graph G have degree at least some k, then every tree with at most k edges is a subgraph of G. We prove the conjecture for all trees of diameter at most 5 and for a class of caterpillars. Our result implies a bound on the Ramsey number r(T,T') of trees T,T' from the above classes.

  • Czech name

    Domněnka Loebla, Komlóse a Sósové pro stromy o průměru 5 a pro některé housenky

  • Czech description

    Domněnka Loebla, Komlóse a Sósové říká, že pokud alespoň polovina vrcholů grafu G má stupeň alespoň k, pak libovolný strom s k hranami je podgrafem grafu G. Dokážeme domněnku pro stromy o průměru 5 a pro určité třídy housenek. Náš výsledek implikuje horní mez pro Ramseyovo číslo r(T,T') pro stromy T a T' z výše uvedené třídy.

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2008

  • 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

  • Name of the periodical

    Electronic Journal of Combinatorics

  • ISSN

    1077-8926

  • e-ISSN

  • Volume of the periodical

    15

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    11

  • Pages from-to

  • UT code for WoS article

    000258476300001

  • EID of the result in the Scopus database