The following pages link to Coloring n-sets red and blue (Q1146686):
Displaying 19 items.
- Equitable two-colorings of uniform hypergraphs (Q458597) (← links)
- Lower bounds in the combinatorial problem of Erdős and Lovász (Q606577) (← links)
- Lower bounds for the number of edges in hypergraphs of certain classes (Q630232) (← links)
- On \(r\)-chromatic hypergraphs (Q658071) (← links)
- Coloring non-uniform hypergraphs without short cycles (Q742641) (← links)
- Sparse colour-critical hypergraphs (Q809089) (← links)
- On the chromatic number of simple triangle-free triple systems (Q1010856) (← links)
- On the chromatic number of finite systems of subsets (Q1034015) (← links)
- On a problem of Erdős concerning property B (Q1102961) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- On proper colorings of hypergraphs (Q1930218) (← links)
- Colorings of partial Steiner systems and their applications (Q2515181) (← links)
- (Q2857438) (← links)
- Conflict-Free Colourings of Uniform Hypergraphs With Few Edges (Q2908131) (← links)
- Greedy colorings of uniform hypergraphs (Q3055773) (← links)
- On proper colourings of hypergraphs using prescribed colours (Q3057818) (← links)
- Random coloring method in the combinatorial problem of Erdős and Lovász (Q3119050) (← links)
- The Minimum Number of Edges in Uniform Hypergraphs with Property O (Q3177361) (← links)
- The intersection spectrum of 3‐chromatic intersecting hypergraphs (Q6051524) (← links)
