Coloring n-sets red and blue
From MaRDI portal
Publication:1146686
DOI10.1016/0097-3165(81)90045-5zbMath0448.05032MaRDI 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
Lower bounds in the combinatorial problem of Erdős and Lovász, Lower bounds for the number of edges in hypergraphs of certain classes, Sparse colour-critical hypergraphs, On the chromatic number of finite systems of subsets, On a problem of Erdős concerning property B, Matchings and covers in hypergraphs, Greedy colorings of uniform hypergraphs, On proper colourings of hypergraphs using prescribed colours
Cites Work