On coloring uniform hypergraphs without 3-cycles

zbMATH Open1255.05127MaRDI QIDQ446271FDOQ446271

D. A. Shabanov

Publication date: 5 September 2012

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

Recommendations

• Coloring non-uniform hypergraphs without short cycles
• On colorings of non-uniform hypergraphs without short cycles
• Constructions of sparse uniform hypergraphs with high chromatic number
• Coloring sparse hypergraphs
• On \(r\)-chromatic hypergraphs

zbMATH Keywords

hypergraph coloringssparse hypergraphsrandom recoloring method

Mathematics Subject Classification ID

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

Cited In (7)

• On 3-uniform hypergraphs without linear cycles
• 3-uniform hypergraphs without a cycle of length five
• Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
• ON HYPERGRAPH COLOURINGS
• Title not available (Why is that?)
• On 3-uniform hypergraphs without a cycle of a given length
• On rainbow-free colourings of uniform hypergraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q446271)