AbstractWe prove that every graph of girth at least 5 with minimum degree δ ⩾ k/2 contains every tree with k edges, whose maximum degree does not exceed the maximum degree of the graph. An immediate consequence is that the famous Erdős-Sós Conjecture, saying that every graph of order n with more than n(k − 1)/2 edges contains every tree with k edges, is true for graphs of girth at least 5
AbstractThe length of the shortest cycle in a graph G is called the girth of G. In particular, we sh...
We investigate a tantalizing problem in extremal graph theory known as the Erdős-Sós conjecture. The...
Loebl, Komlos, and Sos conjectured that if at least half the vertices of a graph G have degree at le...
AbstractWe prove that every graph of girth at least 5 with minimum degree δ ⩾ k/2 contains every tre...
AbstractDobson (1994) conjectured that if G is a graph with girth no less than 2t + 1 and minimum de...
The girth of a graph G is the length of a shortest cycle in G. Dobson (1994, Ph.D. dissertation, Lou...
AbstractThe girth of a graph G is the length of a shortest cycle in G. Dobson (1994, Ph. D. disserta...
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...
AbstractErdős and Sós conjectured in 1963 that ifGis a graph of ordernand sizee(G) withe(G)>12n(k−1)...
Suppose G is a simple graph with average vertex degree greater than k - 2. Erdös and Sós conjectured...
Suppose G is a simple graph with average vertex degree greater than k - 2. Erdös and Sós conjectured...
AbstractDobson conjectured that for every t and k a tree with k vertices can always be embedded into...
AbstractDobson (1994) conjectured that if G is a graph with girth no less than 2t + 1 and minimum de...
We show that any n‐vertex extremal graph G without cycles of length at most k has girth exactly $k+1...
AbstractThis paper determines lower bounds on the number of different cycle lengths in a graph of gi...
AbstractThe length of the shortest cycle in a graph G is called the girth of G. In particular, we sh...
We investigate a tantalizing problem in extremal graph theory known as the Erdős-Sós conjecture. The...
Loebl, Komlos, and Sos conjectured that if at least half the vertices of a graph G have degree at le...
AbstractWe prove that every graph of girth at least 5 with minimum degree δ ⩾ k/2 contains every tre...
AbstractDobson (1994) conjectured that if G is a graph with girth no less than 2t + 1 and minimum de...
The girth of a graph G is the length of a shortest cycle in G. Dobson (1994, Ph.D. dissertation, Lou...
AbstractThe girth of a graph G is the length of a shortest cycle in G. Dobson (1994, Ph. D. disserta...
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...
AbstractErdős and Sós conjectured in 1963 that ifGis a graph of ordernand sizee(G) withe(G)>12n(k−1)...
Suppose G is a simple graph with average vertex degree greater than k - 2. Erdös and Sós conjectured...
Suppose G is a simple graph with average vertex degree greater than k - 2. Erdös and Sós conjectured...
AbstractDobson conjectured that for every t and k a tree with k vertices can always be embedded into...
AbstractDobson (1994) conjectured that if G is a graph with girth no less than 2t + 1 and minimum de...
We show that any n‐vertex extremal graph G without cycles of length at most k has girth exactly $k+1...
AbstractThis paper determines lower bounds on the number of different cycle lengths in a graph of gi...
AbstractThe length of the shortest cycle in a graph G is called the girth of G. In particular, we sh...
We investigate a tantalizing problem in extremal graph theory known as the Erdős-Sós conjecture. The...
Loebl, Komlos, and Sos conjectured that if at least half the vertices of a graph G have degree at le...
DOI
Add to ORKG