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”

Filters

1 066 (0,164s)

Result

Loebl-Komlós-Sós Conjecture: dense case

We prove a version of the Loebl-Komlós-Sós Conjecture for large dense graphs. For any q}0 there exists n' such that for any n}n' holds: If G has median degree at least k, then any tree of order at most k 1 is a sub...

BA - Obecná matematika

  • 2009
  • Jx
Result

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

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 tree...

BA - Obecná matematika

  • 2008
  • Jx
Result

A version of the LoeblKomlósSós Conjecture for Skew Trees

Loebl, Komlós, and Sós conjectured that any graph with at least half of its vertices of degree at least contains every tree with at most edges. We propose a version of this conjecture for skew trees, i.e...

Pure mathematics

  • 2020
  • Jimp
  • Link
Result

An approximate version of the Loebl-Komlós-Sós conjecture

The LoeblKomlósSós conjecture states that, given a graph G and a natural number k, if at least half the vertices of G have degree at least k, then any tree with at most k edges is a subgraph of G. We prove an approximate version of this ...

BA - Obecná matematika

  • 2007
  • Jx
Result

The approximate Loebl-Komlós-Sós Conjecture IV: Embedding techniques and the proof of the main result

This is the last of a series of four papers in which we prove the following relaxation of the Loebl-Komlós-Sós conjecture: For every $alpha>0$ there exists a number $k_0$ such that for every $k>k_0$, every $n$-vert...

Pure mathematics

  • 2017
  • Jimp
  • Link
Result

A Skew Version of the LoeblKomlósSós Conjecture

Loebl, Komlós, and Sós conjectured that any graph such that at least half of its vertices have degree at least k contains every tree of order at most k + 1. We propose a skew version of this conjecture. We...

Pure mathematics

  • 2017
  • JSC
  • Link
Result

Loebl-Komlós-Sós Conjecture: dense case

We prove a version of the Loebl-Komlos-Sos Conjecture for dense graphs. For each $q>0$ there exists a number $n_0 in mathbb N$ such that for each $n>n_0$ and $k>qn$ the following holds: if $G$ is a graph of order $n$ with at least $...

BA - Obecná matematika

  • 2016
  • Jx
  • Link
Result

The approximate Loebl-Komlós-Sós Conjecture II: The rough structure of LKS graphs

This is the second of a series of four papers in which we prove the following relaxation of the Loebl-Komlós-Sós conjecture: For every $alpha>0$ there exists a number $k_0$ such that for every $k>k_0$, every $n$-ve...

Pure mathematics

  • 2017
  • Jimp
  • Link
Result

The approximate Loebl-Komlós--Sós conjecture and embedding trees in sparse graphs

Loebl, Komlós and Sós conjectured that every n-vertex graph G with at least n/2 vertices of degree at least k contains each tree T of order k+1 as a subgraph. We give a sketch of a proof of the approximate version ...

BA - Obecná matematika

  • 2015
  • Jx
  • Link
Result

The Approximate Loebl-Komlos-Sos Conjecture III: The Finer Structure of LKS Graphs

This is the third of a series of four papers in which we prove the following relaxation of the Loebl--Komlós--Sós conjecture: For every $alpha>0$ there exists a number $k_0$ such that for every $k>k_0$, every $n$-v...

Pure mathematics

  • 2017
  • Jimp
  • Link
  • 1 - 10 out of 1 066