On graphs which contain each tree of given size (Q1356784): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Erdös-Sós conjecture for graphs of girth 5 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Packing constants in graphs and connectivity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Erd�s-S�s conjecture / rank | |||
Normal rank | |||
Revision as of 14:13, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On graphs which contain each tree of given size |
scientific article |
Statements
On graphs which contain each tree of given size (English)
0 references
25 November 1997
0 references
There is a conjecture by Dobson that a graph of sufficiently large girth and minimum degree contains each tree of a given size. In this sense, the paper proves that for a graph \(G\) with girth at least 7 and a tree \(T\) of size \(k\) the following holds: If the minimum degree of \(G\) is at least \(k/3\) and also at least the maximum degree of \(T\) then \(G\) contains \(T\).
0 references
girth
0 references
tree
0 references
