New Proofs of K\"onigs Theorem
Combinatorics
2017-09-06 v4
Abstract
We introduce four new elementary short proofs of the famous K\"onig's theorem which characterizes bipartite graphs by absence of odd cycles.
Cite
@article{arxiv.1505.01745,
title = {New Proofs of K\"onigs Theorem},
author = {Salman Ghazal},
journal= {arXiv preprint arXiv:1505.01745},
year = {2017}
}