Every tree contains a large induced subgraph with all degrees odd
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.
scientific article; zbMATH DE number 769319