Add to ORKGLoebl, Komlos, and Sos conjectured that if at least half the vertices of a graph G have degree at least some k is an element of N, 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
Artículo de publicación ISILoebl, Komlos and Sos conjectured that every n-vertex graph G with at lea...
AbstractSufficient conditions are given in terms of δ(G) and Δ(T), for a graph G with n vertices to ...
The Erdös–Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k − 1)/2 co...
Loebl, Komlos, and Sos conjectured that if at least half the vertices of a graph G have degree at le...
AbstractLoebl, Komlós, and Sós conjectured that if at least half of the vertices of a graph G have d...
AbstractLoebl, Komlós, and Sós conjectured that if at least half of the vertices of a graph G have d...
A conjecture of Loebl, also known as the (n/2 − n/2 − n/2) Conjecture, states that if G is an n-vert...
A conjecture of Loebl, also known as the (n/2 − n/2 − n/2) Conjecture, states that if G is an n-vert...
AbstractThe Ramsey Number r(G1, G2) is the least integer N such that for every graph G with N vertic...
AbstractWe prove that every graph of girth at least 5 with minimum degree δ ⩾ k/2 contains every tre...
AbstractWe investigate those graphs Gn with the property that any tree on n vertices occurs as subgr...
AbstractThe Loebl–Komlós–Sós conjecture states that for any integers k and n, if a graph G on n vert...
AbstractDobson (1994) conjectured that if G is a graph with girth no less than 2t + 1 and minimum de...
AbstractGraphs with n + k vertices in which every set of n + j vertices induce a subgraph of maximum...
Artículo de publicación ISILoebl, Komlos and Sos conjectured that every n-vertex graph G with at lea...
Artículo de publicación ISILoebl, Komlos and Sos conjectured that every n-vertex graph G with at lea...
AbstractSufficient conditions are given in terms of δ(G) and Δ(T), for a graph G with n vertices to ...
The Erdös–Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k − 1)/2 co...
Loebl, Komlos, and Sos conjectured that if at least half the vertices of a graph G have degree at le...
AbstractLoebl, Komlós, and Sós conjectured that if at least half of the vertices of a graph G have d...
AbstractLoebl, Komlós, and Sós conjectured that if at least half of the vertices of a graph G have d...
A conjecture of Loebl, also known as the (n/2 − n/2 − n/2) Conjecture, states that if G is an n-vert...
A conjecture of Loebl, also known as the (n/2 − n/2 − n/2) Conjecture, states that if G is an n-vert...
AbstractThe Ramsey Number r(G1, G2) is the least integer N such that for every graph G with N vertic...
AbstractWe prove that every graph of girth at least 5 with minimum degree δ ⩾ k/2 contains every tre...
AbstractWe investigate those graphs Gn with the property that any tree on n vertices occurs as subgr...
AbstractThe Loebl–Komlós–Sós conjecture states that for any integers k and n, if a graph G on n vert...
AbstractDobson (1994) conjectured that if G is a graph with girth no less than 2t + 1 and minimum de...
AbstractGraphs with n + k vertices in which every set of n + j vertices induce a subgraph of maximum...
Artículo de publicación ISILoebl, Komlos and Sos conjectured that every n-vertex graph G with at lea...
Artículo de publicación ISILoebl, Komlos and Sos conjectured that every n-vertex graph G with at lea...
AbstractSufficient conditions are given in terms of δ(G) and Δ(T), for a graph G with n vertices to ...
The Erdös–Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k − 1)/2 co...