On almost-regular edge colourings of hypergraphs

zbMATH Open1351.05071MaRDI QIDQ727175FDOQ727175

Authors: Darryn 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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article; zbMATH DE number 524129
• Extending edge‐colorings of complete hypergraphs into regular colorings
• Extending regular edge-colorings of complete hypergraphs
• On equitable colorings of hypergraphs
• Equitable colorings of nonuniform hypergraphs

zbMATH Keywords

hypergraphsedge colouring

Mathematics Subject Classification ID

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

Cites Work

• Amalgamations of almost regular edge-colourings of simple graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations
• Detachments of hypergraphs I: The Berge-Johnson problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Embedding factorizations for 3-uniform hypergraphs
• Detachments of amalgamated 3-uniform hypergraphs: factorization consequences
• The edge-coloring of complete hypergraphs. I
• Disjoint spread systems and fault location
• Almost regular edge colorings and regular decompositions of complete graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (14)

• Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations
• Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions
• More constructions for Sperner partition systems
• New bounds on the maximum size of Sperner partition systems
• Title not available (Why is that?)
• Amalgamations of almost regular edge-colourings of simple graphs
• A construction of optimal 1-spontaneous emission error designs
• On regular set systems containing regular subsystems
• An Edge Ordering Problem of Regular Hypergraphs
• Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes
• On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs
• Hamilton path decompositions of complete multipartite graphs
• Extending regular edge-colorings of complete hypergraphs
• On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture

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

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