论文标题
每个图都包含一个线性大小的诱导子图，并具有所有程度的奇数
Every graph contains a linearly sized induced subgraph with all degrees odd
论文作者
论文摘要
我们证明，$ n $顶点上的每个图$ g $都没有孤立的顶点包含一个诱导的大小的子图，至少$ n/10000 $，所有学位奇数。这在图理论中解决了一个古老而众所周知的猜想。
We prove that every graph $G$ on $n$ vertices with no isolated vertices contains an induced subgraph of size at least $n/10000$ with all degrees odd. This solves an old and well-known conjecture in graph theory.
