Coloring n-sets red and blue
From MaRDI portal
Publication:1146686
DOI10.1016/0097-3165(81)90045-5zbMath0448.05032OpenAlexW1995615993MaRDI QIDQ1146686
Publication date: 1981
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(81)90045-5
Related Items
The Minimum Number of Edges in Uniform Hypergraphs with Property O, Conflict-Free Colourings of Uniform Hypergraphs With Few Edges, On a problem of Erdős concerning property B, Lower bounds in the combinatorial problem of Erdős and Lovász, On proper colorings of hypergraphs, The intersection spectrum of 3‐chromatic intersecting hypergraphs, Extremal problems in hypergraph colourings, Lower bounds for the number of edges in hypergraphs of certain classes, Equitable two-colorings of uniform hypergraphs, On \(r\)-chromatic hypergraphs, Colourings of Uniform Hypergraphs with Large Girth and Applications, Unnamed Item, Greedy colorings of uniform hypergraphs, On proper colourings of hypergraphs using prescribed colours, Colorings of partial Steiner systems and their applications, Coloring non-uniform hypergraphs without short cycles, On the chromatic number of simple triangle-free triple systems, Matchings and covers in hypergraphs, On the chromatic number of finite systems of subsets, Random coloring method in the combinatorial problem of Erdős and Lovász, Sparse colour-critical hypergraphs
Cites Work
