2000 character limit reached
Note on Perfect Forests
Published 6 Jan 2015 in cs.DM | (1501.01079v1)
Abstract: A spanning subgraph $F$ of a graph $G$ is called perfect if $F$ is a forest, the degree $d_F(x)$ of each vertex $x$ in $F$ is odd, and each tree of $F$ is an induced subgraph of $G$. We provide a short proof of the following theorem of A.D. Scott (Graphs & Combin., 2001): a connected graph $G$ contains a perfect forest if and only if $G$ has an even number of vertices.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.