Abstract
AbstractGiven two graphs, a mapping between their edge‐sets is cycle‐continuous, if the preimage of every cycle is a cycle. The motivation for this definition is Jaeger's conjecture that for every bridgeless graph there is a cycle‐continuous mapping to the Petersen graph, which, if solved positively, would imply several other important conjectures (e.g., the Cycle double cover conjecture). Answering a question of DeVos, Nešetřil, and Raspaud, we prove that there exists an infinite set of graphs with no cycle‐continuous mapping between them. Further extending this result, we show that every countable poset can be represented by graphs and the existence of cycle‐continuous mappings between them.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.