On the degree, size, and chromatic index of a uniform hypergraph

DOI10.1006/JCTA.1996.2728zbMath0868.05037OpenAlexW2049107701MaRDI QIDQ5961544

Noga Alon, Jeong Han Kim

Publication date: 18 August 1997

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

Full work available at URL: https://semanticscholar.org/paper/6785d179401e0ae123c92c0b4f8a2167b95b2817

zbMATH Keywords

hypergraphsizedegreechromatic index

Mathematics Subject Classification ID

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

Related Items (8)

Decomposition of bi-colored square arrays into balanced diagonals ⋮ Ramsey-nice families of graphs ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Decomposition of Bicolored Square Arrays into Bichromatic Diagonals ⋮ Lower bounds on circuit depth of the quantum approximate optimization algorithm ⋮ Unnamed Item ⋮ A Stability Theorem for Matchings in Tripartite 3-Graphs ⋮ On the Chromatic Index of Random Uniform Hypergraphs

This page was built for publication: On the degree, size, and chromatic index of a uniform hypergraph