On graphs which contain each tree of given size (Q1356784): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(97)84218-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1986702149 / rank | |||
Normal rank | |||
Revision as of 11:26, 30 July 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
