On almost-regular edge colourings of hypergraphs

zbMath1351.05071MaRDI QIDQ727175

Darryn E. Bryant

Publication date: 6 December 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p7

zbMATH Keywords

hypergraphsedge colouring

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions ⋮ More constructions for Sperner partition systems ⋮ A construction of optimal 1-spontaneous emission error designs ⋮ Hamilton path decompositions of complete multipartite graphs ⋮ New bounds on the maximum size of Sperner partition systems ⋮ On regular set systems containing regular subsystems ⋮ Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations

Cites Work

• Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations
• Amalgamations of almost regular edge-colourings of simple graphs
• The edge-coloring of complete hypergraphs. I
• Disjoint Spread Systems and Fault Location
• Detachments of Hypergraphs I: The Berge–Johnson Problem
• Almost regular edge colorings and regular decompositions of complete graphs
• Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences
• Embedding Factorizations for 3-Uniform Hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On almost-regular edge colourings of hypergraphs