A note on uniquely embeddable 2-factors

2023/04/25 by Grzelec, Igor, Pilśniak, Monika, Woźniak, Mariusz
#05C70 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2304.12915

Abstract

Let C_n1∪ C_n2∪ … ∪ C_nk be a 2-factor i.e. a vertex-disjoint union of cycles. In this note we completely characterize those 2-factors that are uniquely embeddeble in their complement.

Related

• Intersections of Cycling 2-factors
• A spanning union of cycles in thin cylinder, torus and Klein bottle grid graphs
• A note on the number of non-cycle components in a pseudo 2-factor of graphs
• On uniqueness of packing of three copies of 2-factors
• Non-embeddable II₁ factors resembling the hyperfinite II₁ factor