The edge-coloring of complete hypergraphs. I
From MaRDI portal
Publication:1260045
DOI10.1016/0095-8956(79)90002-9zbMath0413.05040OpenAlexW1992519511MaRDI QIDQ1260045
Publication date: 1979
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(79)90002-9
Hypergraphs (05C65) Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15)
Related Items
Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree, Factorizations of complete multipartite hypergraphs, Detachments of Hypergraphs I: The Berge–Johnson Problem, Amalgamations of almost regular edge-colourings of simple graphs, Euler tours in hypergraphs, Edge coloring complete uniform hypergraphs with many components, Bounds on directed star arboricity in some digraph classes, A simple proof that all 1-designs exist, Decompositions of complete uniform hypergraphs into Hamilton Berge cycles, Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences, On almost-regular edge colourings of hypergraphs, The controlled rounding problem: Complexity and computational experience, Cost-efficient mixed-level covering designs for testing experiments, On some characterisations of totally unimodular matrices, The controlled rounding problem: Relaxations and complexity issues, Disjoint Spread Systems and Fault Location, Partitioning the power set of \([n\) into \(C_k\)-free parts], Integral decomposition in polyhedra
Cites Work
- On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
- A simple proof of the Erdős-Chao Ko-Rado theorem
- Network Flows, Minimum Coverings, and the Four-Color Conjectures
- On separating systems of a finite set
- A finite set covering theorem
- Chromatic Numbers for Certain Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
