Every tree contains a large induced subgraph with all degrees odd (Q1893180): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:13, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every tree contains a large induced subgraph with all degrees odd |
scientific article |
Statements
Every tree contains a large induced subgraph with all degrees odd (English)
0 references
28 September 1995
0 references
It is proved that every tree of order \(n\) contains an induced subgraph of order at least \(2\lfloor(n+ 1)/ 3\rfloor\) with all degrees odd; and this bound is best possible.
0 references
tree
0 references
induced subgraph
0 references
bound
0 references
