On coloring uniform hypergraphs without 3-cycles

zbMath1255.05127MaRDI QIDQ446271

Dmitriy A. Shabanov

Publication date: 5 September 2012

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

zbMATH Keywords

hypergraph coloringssparse hypergraphsrandom recoloring method

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Density (toughness, etc.) (05C42)

This page was built for publication: On coloring uniform hypergraphs without 3-cycles