sxlxc/evencut
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 1 Wiki Activity

Update notes.tex

Browse Source
This commit is contained in:
Yu Cong
2025-11-05 00:02:31 +08:00
parent 10c8dccad8
commit 1e2dbd7074
1 changed files with 0 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
notes.tex
View File

@@ -95,7 +95,6 @@ Then $X$ fails to be a hitting set is equivalent to the fact that there does not
So $X$ hits all $\{C(B,f)|\forall B\}$ iff there is such a $y$. Minimizing $X$ pushes it to $\supp(yA)$ which is an odd cocycle. Hence, the minimum hitting set for $C(B,f)$ is always an odd cocycle. So $X$ hits all $\{C(B,f)|\forall B\}$ iff there is such a $y$. Minimizing $X$ pushes it to $\supp(yA)$ which is an odd cocycle. Hence, the minimum hitting set for $C(B,f)$ is always an odd cocycle.
The theorem then follows directly from the fact that any cocycle is either odd or even. The theorem then follows directly from the fact that any cocycle is either odd or even.
\end{proof} \end{proof}
\end{document} \end{document}