The following pages link to On 3-chromatic hypergraphs (Q1137600):
Displaying 47 items.
- Equitable colorings of non-uniform simple hypergraphs (Q322355) (← links)
- Equitable colorings of nonuniform hypergraphs (Q325641) (← links)
- Some new bounds on partition critical hypergraphs (Q412276) (← links)
- Equitable two-colorings of uniform hypergraphs (Q458597) (← links)
- On the construction of non-2-colorable uniform hypergraphs (Q476325) (← links)
- 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)
- On \(r\)-chromatic hypergraphs (Q658071) (← links)
- Improvement of the lower bound in the Erdös-Hajnal combinatorial problem (Q736013) (← 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)
- 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 proper colorings of hypergraphs (Q1930218) (← links)
- Concepts on coloring of cluster hypergraphs with application (Q2196923) (← links)
- Around Erdős-Lovász problem on colorings of non-uniform hypergraphs (Q2352063) (← links)
- DP-colorings of hypergraphs (Q2422217) (← links)
- Colorings of partial Steiner systems and their applications (Q2515181) (← links)
- On the chromatic number of set systems (Q2748418) (← links)
- (Q2857438) (← links)
- Conflict-Free Colourings of Uniform Hypergraphs With Few Edges (Q2908131) (← links)
- Greedy colorings of uniform hypergraphs (Q3055773) (← 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)
- An algorithmic approach to the Lovász local lemma. I (Q3986105) (← links)
- Colourings of Uniform Hypergraphs with Large Girth and Applications (Q4643316) (← links)
- A note on two-colorability of nonuniform hypergraphs (Q5002721) (← links)
- The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs (Q5048297) (← links)
- A General Framework for Hypergraph Coloring (Q5093586) (← links)
- Improved Bounds for Uniform Hypergraphs without Property B (Q5109054) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- The intersection spectrum of 3‐chromatic intersecting hypergraphs (Q6051524) (← links)
