Every tree contains a large induced subgraph with all degrees odd (Q1893180): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Andrew John Radcliffe / rank | |||
| Property / author | |||
| Property / author: Q222637 / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Dietmar Cieslik / rank | |||
| Property / author | |||
| Property / author: Andrew John Radcliffe / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Alexander D. Scott / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Dietmar Cieslik / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198785 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On induced subgraphs with odd degrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On induced subgraphs of trees, with restricted degrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3880849 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Large Induced Subgraphs with All Degrees Odd / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:09, 23 May 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
