On almost-regular edge colourings of hypergraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3654171 (Why is no real title available?)
- scientific article; zbMATH DE number 3675931 (Why is no real title available?)
- scientific article; zbMATH DE number 3683587 (Why is no real title available?)
- scientific article; zbMATH DE number 3478938 (Why is no real title available?)
- scientific article; zbMATH DE number 3563169 (Why is no real title available?)
- scientific article; zbMATH DE number 524129 (Why is no real title available?)
- scientific article; zbMATH DE number 1996256 (Why is no real title available?)
- Almost regular edge colorings and regular decompositions of complete graphs
- Amalgamations of almost regular edge-colourings of simple graphs
- Detachments of amalgamated 3-uniform hypergraphs: factorization consequences
- Detachments of hypergraphs I: The Berge-Johnson problem
- Disjoint spread systems and fault location
- Embedding factorizations for 3-uniform hypergraphs
- Embedding factorizations for 3-uniform hypergraphs II: r-factorizations into s-factorizations
- The edge-coloring of complete hypergraphs. I
Cited in
(15)- On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture
- Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations
- New bounds on the maximum size of Sperner partition systems
- Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions
- More constructions for Sperner partition systems
- Extending edge-colorings of complete hypergraphs into regular colorings
- scientific article; zbMATH DE number 524129 (Why is no real title available?)
- Amalgamations of almost regular edge-colourings of simple graphs
- On regular set systems containing regular subsystems
- Edge-colourings characterizing a class of Cayley graphs and a new characterization of hypercubes
- A construction of optimal 1-spontaneous emission error designs
- An Edge Ordering Problem of Regular Hypergraphs
- Hamilton path decompositions of complete multipartite graphs
- On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs
- Extending regular edge-colorings of complete hypergraphs
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)