Every tree contains a large induced subgraph with all degrees odd (Q1893180)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Every tree contains a large induced subgraph with all degrees odd |
scientific article; zbMATH DE number 769319
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every tree contains a large induced subgraph with all degrees odd |
scientific article; zbMATH DE number 769319 |
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
