Weak embedding theorem and a proof of cycle double cover of bridgeless graphs
Combinatorics
2017-12-20 v1
Abstract
In this article, we give a positive answer to the cycle double cover conjecture. Ones who are mainly interesting in the proof of the conjecture can only read Sections 2 and 4.
Cite
@article{arxiv.1712.06953,
title = {Weak embedding theorem and a proof of cycle double cover of bridgeless graphs},
author = {Bin Shen},
journal= {arXiv preprint arXiv:1712.06953},
year = {2017}
}
Comments
22 pages,1 figure