2000 character limit reached
Weak embedding theorem and a proof of cycle double cover of bridgeless graphs (1712.06953v1)
Published 11 Dec 2017 in math.CO
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.