Configurations in 4-cycle systems

DOI10.1007/S00373-004-0553-4MaRDI QIDQ1889824zbMATH OpenOpenAlexFDO

Authors Martin Mačaj, Darryn Bryant, Michael John Grannell, T. S. Griggs

Publication date 13 December 2004

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-004-0553-4

zbMATH Keywords

4-Cycle systemsavoidanceconfigurations

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Review text

A \(4\)-cycle system of order \(n\) is a collection of \(4\)-cycles which form a decomposition of the edge set of the complete graph on \(n\) vertices. There are four possible configurations obtained as union of two \(4\)-cycles. The paper deals with counting frequencies of the four configurations in \(4\)-cycle systems. It is shown that the configuration isomorphic to the complete bipartite graph \(K_{2,4}\) plays a special role. For each admissible value of \(n,\) a \(4\)-cycle system of order \(n\) avoiding this configuration is constructed.

Recommendations

• Super-simple twofold 4-cycle systems
• scientific article; zbMATH DE number 5778186
• Diagonally switchable 4-cycle systems
• Almost resolvable 4-cycle systems
• Embedding path designs in 4-cycle systems
• Sparseness of 4-cycle systems
• Coloring 4-cycle systems
• scientific article; zbMATH DE number 4075123
• Four-cycle systems with two-regular leaves
• Diagonally switchable 4-cycle systems revisited

Cited in

(5)

• Super-simple twofold 4-cycle systems
• Sparseness of 4-cycle systems
• Diagonally switchable 4-cycle systems
• Four-cycle systems with two-regular leaves
• Two types of switchable \(\lambda \)-fold \((K_4 - e)\)-designs

This page was built for publication: Configurations in 4-cycle systems

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