A note on two-colorability of nonuniform hypergraphs

DOI10.4230/LIPIcs.ICALP.2018.46zbMath1504.05202arXiv1803.03060MaRDI QIDQ5002721

Grzegorz Gutowski, Jakub Kozik, Lech Duraj

Publication date: 28 July 2021

Full work available at URL: https://arxiv.org/abs/1803.03060

zbMATH Keywords

hypergraph coloringproperty Bnonuniform hypergraphsrandom greedy coloring

Mathematics Subject Classification ID

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

Related Items (2)

Extremal problems in hypergraph colourings ⋮ New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On 3-chromatic hypergraphs
• On the construction of 3-chromatic hypergraphs with few edges
• Around Erdős-Lovász problem on colorings of non-uniform hypergraphs
• A note on random greedy coloring of uniform hypergraphs
• Improved bounds and algorithms for hypergraph 2-coloring
• On a property of families of sets
• On a combinatorial problem. II

This page was built for publication: A note on two-colorability of nonuniform hypergraphs