2-colorings of uniform hypergraphs

DOI10.1134/S0001434616090340zbMATH Open1365.05088MaRDI QIDQ509176FDOQ509176

Authors: Yury A. Demidovich, Andrei M. Raigorodskii 

Publication date: 9 February 2017

Published in: Mathematical Notes (Search for Journal in Brave)

Recommendations

• On some generalizations of the property B problem of an \(n\)-uniform hypergraph
• Improved Bounds for Uniform Hypergraphs without Property B
• Combinatorial extremum problems for 2-colorings of hypergraphs
• On balanced colorings of hypergraphs
• Extremal problems for colourings of uniform hypergraphs

zbMATH Keywords

hypergraph coloring\(n\)-uniform hypergraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cites Work

• On a property of families of sets
• Improved bounds and algorithms for hypergraph 2-coloring
• Title not available (Why is that?)
• A note on random greedy coloring of uniform hypergraphs
• Color-critical graphs and hypergraphs with few edges: a survey
• On a combinatorial problem. II

Cited In (7)

• On 2-coloring certain \(k\)-uniform hypergraphs
• On balanced colorings of hypergraphs
• On the construction of non-2-colorable uniform hypergraphs
• On some generalizations of the property B problem of an \(n\)-uniform hypergraph
• On the vertex number of almost bipartite hypergraphs
• Equitable colorings of hypergraphs with \(r\) colors
• New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)

This page was built for publication: 2-colorings of uniform hypergraphs

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