Orthogonal decomposition and packing of complete graphs

DOI10.1006/jcta.1999.2981zbMath0938.05052OpenAlexW2042976533MaRDI QIDQ1806215

Raphael Yuster, Yair Caro

Publication date: 20 December 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1999.2981

zbMATH Keywords

packingedge-decompositions

Mathematics Subject Classification ID

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

Related Items (8)

Non-zero sum Heffter arrays and their applications ⋮ A generalization of Heffter arrays ⋮ Orthogonal cycle systems with cycle length less than 10 ⋮ Intersecting designs ⋮ Completely reducible super-simple designs with block size five and index two ⋮ Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \) ⋮ Globally simple Heffter arrays and orthogonal cyclic cycle decompositions ⋮ Superpure digraph designs

Cites Work

• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• On large sets of disjoint Steiner triple systems. VI
• Steiner quadruple systems having a prescribed number of quadruples in common
• Construction of Steiner quadruple systems having a prescribed number of blocks in common
• A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
• Intersections of Steiner quadruple systems
• Covering graphs: The covering problem solved
• The intersection problem for \(K_4-e\) designs
• Orthogonal double covers of complete graphs by trees
• The intersection problem for star designs
• Packing graphs: The packing problem solved
• Intersections among Steiner systems
• On a problem of Hering concerning orthogonal covers of \({\mathbf K}_ n\)
• On the existence of super-simple designs with block size 4
• Intersection Properties of Steiner Systems
• Steiner Triple Systems Having a Prescribed Number of Triples in Common
• On orthogonal double covers of k_n and a conjecture of chung and west
• Orthogonal matchings
• On orthogonal double covers of graphs
• Super-simple designs with \(v\leq 32\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Orthogonal decomposition and packing of complete graphs