Coloring simple hypergraphs

Authors:
Alan Frieze;Dhruv Mubayi
Affiliations:
Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, United States;Department of Mathematics, Statistics, and Computer Science, University of Illinois, Chicago, IL 60607, United States
Venue:
Journal of Combinatorial Theory Series B
Year:
2013

Citing 6
Cited 0

Asymptotically good list-colorings

Journal of Combinatorial Theory Series A
Coloring graphs with sparse neighborhoods

Journal of Combinatorial Theory Series B
On the chromatic number of set systems

Random Structures & Algorithms
Sparse Parity-Check Matrices over ${GF(q)}$

Combinatorics, Probability and Computing
Coloring H-free hypergraphs

Random Structures & Algorithms - Special 20th Anniversary Issue
On uncrowded hypergraphs

Random Structures & Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fix an integer k=3. A k-uniform hypergraph is simple if every two edges share at most one vertex. We prove that there is a constant c depending only on k such that every simple k-uniform hypergraph H with maximum degree @D has chromatic number satisfying@g(H)