On the existence of unparalleled even cycle systems

DOI10.1016/J.EJC.2016.07.001zbMATH Open1348.05104OpenAlexW2963787518MaRDI QIDQ326644FDOQ326644

Authors Peter Danziger, Eric Mendelsohn, Tommaso Traetta 

Publication date 12 October 2016

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1510.07082

zbMATH Keywords

complete graphsunparalleled systems

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: A $2t$-cycle system of order $v$ is a set $mathcalC$ of cycles whose edges partition the edge-set of $K_v-I$ (i.e., the complete graph minus the $1$-factor $I$). If $vequiv0pmod2t$, a set of $v/2t$ vertex-disjoint cycles of $mathcalC$ is a parallel class. If $mathcalC$ has no parallel classes, we call such a system unparalleled. We show that there exists an unparalleled $2t$-cycle system of order $vequiv0pmod2t$ if and only if $v>2t>2$.

Recommendations

• \(k\)-cyclic even cycle systems of the complete graph
• Cyclic even cycle systems of the complete graph
• scientific article; zbMATH DE number 1228814
• Even \((m_1,m_2,\dots ,m_r)\)-cycle systems of the complete graph.
• A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\)

Cites Work

• scientific article; zbMATH DE number 3981181 (Why is no real title available?)
• scientific article; zbMATH DE number 4006279 (Why is no real title available?)
• scientific article; zbMATH DE number 4044061 (Why is no real title available?)
• scientific article; zbMATH DE number 3443668 (Why is no real title available?)
• scientific article; zbMATH DE number 3392464 (Why is no real title available?)
• 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
• 2-starters, graceful labelings, and a doubling construction for the Oberwolfach problem
• A complete solution to the two-table Oberwolfach problems
• A second infinite family of Steiner triple systems without almost parallel classes
• Complete solutions to the Oberwolfach problem for an infinite set of orders
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Existence of non‐resolvable Steiner triple systems
• Latin squares without orthogonal mates
• Monogamous latin squares
• On 2-factorizations of the complete graph: From thek-pyramidal to the universal property
• On 2-pyramidal Hamiltonian cycle systems
• On bipartite 2-factorizations of \(K_{n} - I\) and the Oberwolfach problem
• On the Hamilton-Waterloo problem with odd orders
• On the full automorphism group of a Hamiltonian cycle system of odd order
• Some cyclic solutions to the three table Oberwolfach problem
• Some new results on 1-rotational 2-factorizations of the complete graph
• Some progress on the existence of 1-rotational Steiner triple systems
• Some results on 1-rotational Hamiltonian cycle systems
• Steiner triple systems without parallel classes
• The Oberwolfach problem and factors of uniform odd length cycles
• The existence of Latin squares without orthogonal mates
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• The structure of 2-pyramidal 2-factorizations

Cited In (1)

• Equitably 2-colourable even cycle systems

This page was built for publication: On the existence of unparalleled even cycle systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326644)