Every tree contains a large induced subgraph with all degrees odd (Q1893180): Difference between revisions

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

Mathematics Subject Classification ID

05C05

0 references

0 references

0 references

tree

0 references

induced subgraph

0 references

bound

0 references

author

Andrew John Radcliffe

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Q4198785

0 references

On induced subgraphs with odd degrees

0 references

On induced subgraphs of trees, with restricted degrees

0 references

Q3880849

0 references

Large Induced Subgraphs with All Degrees Odd

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1893180

@@ Property / author @@
+Andrew John Radcliffe
@@ Property / author: Andrew John Radcliffe / rank @@
+Normal rank
@@ Property / author @@
+Alexander D. Scott
@@ Property / author: Alexander D. Scott / rank @@
+Normal rank
@@ Property / reviewed by @@
+Dietmar Cieslik
@@ Property / reviewed by: Dietmar Cieslik / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198785
@@ Property / cites work: Q4198785 / rank @@
+Normal rank
@@ Property / cites work @@
+On induced subgraphs with odd degrees
@@ Property / cites work: On induced subgraphs with odd degrees / rank @@
+Normal rank
@@ Property / cites work @@
+On induced subgraphs of trees, with restricted degrees
+Normal rank
@@ Property / cites work @@
+Q3880849
@@ Property / cites work: Q3880849 / rank @@
+Normal rank
@@ Property / cites work @@
+Large Induced Subgraphs with All Degrees Odd
@@ Property / cites work: Large Induced Subgraphs with All Degrees Odd / rank @@
+Normal rank