Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Note on Perfect Forests (1501.01079v1)

Published 6 Jan 2015 in cs.DM

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.

Citations (9)

Summary

We haven't generated a summary for this paper yet.