The following pages link to On 3-chromatic hypergraphs (Q1137600):
Displayed 23 items.
- On balanced colorings of hypergraphs (Q548768) (← 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)
- Improvement of the lower bound in the Erdös-Hajnal combinatorial problem (Q736013) (← links)
- Sparse colour-critical hypergraphs (Q809089) (← links)
- On the chromatic number of finite systems of subsets (Q1034015) (← links)
- Hypergraphs with high chromatic number (Q1086588) (← links)
- Probabilistic methods (Q1091406) (← links)
- Cycles of length 0 modulo k in directed graphs (Q1093650) (← links)
- On a problem of Erdős concerning property B (Q1102961) (← links)
- Coloring n-sets red and blue (Q1146686) (← links)
- On positional games (Q1149385) (← links)
- On property B(s). II (Q1166541) (← links)
- On-line algorithms for 2-coloring hypergraphs via chip games (Q1210300) (← links)
- Probabilistic methods in coloring and decomposition problems (Q1322212) (← links)
- From Erdős to algorithms (Q1344623) (← links)
- On the frequency of the most frequently occurring variable in dual monotone DNFs (Q1357747) (← links)
- Note on alternating directed cycles (Q1584433) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Some properties of non-bicolorable hypergraphs and the four-color problem (Q1917261) (← links)
- On the chromatic number of set systems (Q2748418) (← links)
- Greedy colorings of uniform hypergraphs (Q3055773) (← links)
- An algorithmic approach to the Lovász local lemma. I (Q3986105) (← links)