2-colorings of uniform hypergraphs

DOI10.1134/S0001434616090340MaRDI QIDQ509176zbMATH OpenFDO

Authors Yury A. Demidovich, Andrei M. Raigorodskii

Publication date 9 February 2017

Published in Mathematical Notes (Search for Journal in Brave)

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)

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

Cites work

• scientific article; zbMATH DE number 3188524 (Why is no real title available?)
• A note on random greedy coloring of uniform hypergraphs
• Color-critical graphs and hypergraphs with few edges: a survey
• Improved bounds and algorithms for hypergraph 2-coloring
• On a combinatorial problem. II
• On a property of families of sets

Cited in

(7)

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

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)