Abstract
A famous theorem in graph theory—originating with Euler—characterizes connected even-degree graphs as (1) those graphs that admit an Euler tour, and (2) those connected graphs that decompose as a face-disjoint union of cycles. We explore a 2-dimensional generalization of this theorem, with graphs (i.e., 1-complexes) replaced by 2-complexes. This entails an interesting generalization of cycles, and the introduction of the notion of a “2-dimensional Euler tour.”
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
