Maximum packings of inside perfect 8-cycle systems

MaRDI QIDQ5206914zbMATH OpenFDO

Authors Selda Küçükçifçi, Sibel Özkan, Emine Şule Yazıcı, C. C. Lindner

Publication date 19 December 2019

Full work available at URL https://arxiv.org/abs/1710.08265, http://ajc.maths.uq.edu.au/pdf/75/ajc_v75_p146.pdf

zbMATH Keywords

\(i\)-perfect cycle systems

Mathematics Subject Classification ID

Paths and cycles (05C38)

Abstract: For an $m$-cycle $C$, an inside $m$-cycle of $C$ is a cycle on the same vertex set, that is edge-disjoint from $C$. In an $m$-cycle system, $(mathcalX,mathcalC)$, if inside $m$-cycles can be chosen -one for each cycle- to form another $m$-cycle system, then $(mathcalX,mathcalC)$ is called an almost $2$-perfect $m$-cycle system. Almost $2$-perfect cycle systems can be considered as generalisations of $2$-perfect cycle systems. Cycle packings are generalisations of cycle systems that allow to have leaves after decomposition. In this paper, we prove that an almost $2$-perfect maximum packing of $K_n$ with $8$-cycles of order $n$ exists for each $ngeq8$. We also construct a maximum $8$-cycle packing of order $n$ which is not almost $2$-perfect for each $ngeq10$.

Recommendations

• Outside perfect 8-cycle systems
• Nonisomorphic maximum packing and minimum covering of K_v with 8-cycles
• scientific article; zbMATH DE number 515363
• \(i\)-perfect \(m\)-cycle systems, \(m\leq 19\)
• scientific article; zbMATH DE number 653245

Cites work

• 2-perfect \(m\)-cycle systems
• 2-perfect m-cycle systems can be equationally defined for m=3, 5, and 7 only
• \(i\)-perfect \(m\)-cycle systems, \(m\leq 19\)
• Almost 2-perfect 6-cycle systems
• Almost 2-perfect minimum coverings of \(K_n\) with 6-cycles
• Cycle decompositions of K_n and K_n-I
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• scientific article; zbMATH DE number 554159 (Why is no real title available?)
• scientific article; zbMATH DE number 2097974 (Why is no real title available?)
• Maximum packings and minimum coverings of \(K_{v}\) with octagons
• New i-perfect cycle decompositions via vertex colorings of graphs
• Nonisomorphic maximum packing and minimum covering of K_v with 8-cycles
• Partitionable perfect cycle systems with cycle lengths 6 and 8
• Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
• Some constructions for cyclic perfect cycle systems
• The spectrum for 2-perfect 6-cycle systems

Cited in

(4)

• Squashing maximum packings of K_n with 8-cycles into maximum packings of K_n with 4-cycles
• Nonisomorphic maximum packing and minimum covering of K_v with 8-cycles
• Outside perfect 8-cycle systems
• Maximum packings and minimum coverings of \(K_{v}\) with octagons

This page was built for publication: Maximum packings of inside perfect \(8\)-cycle systems

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