The following pages link to On \(r\)-chromatic hypergraphs (Q658071):
Displaying 24 items.
- On coloring uniform hypergraphs without 3-cycles (Q446271) (← links)
- Equitable two-colorings of uniform hypergraphs (Q458597) (← links)
- Colorful subhypergraphs in uniform hypergraphs (Q510336) (← links)
- Lower bounds for the number of edges in hypergraphs of certain classes (Q630232) (← links)
- Chromatic Ramsey number of acyclic hypergraphs (Q729769) (← links)
- Improvement of the lower bound in the Erdös-Hajnal combinatorial problem (Q736013) (← links)
- Coloring non-uniform hypergraphs without short cycles (Q742641) (← links)
- On the chromatic number of simple triangle-free triple systems (Q1010856) (← links)
- Hypergraphs with high chromatic number (Q1086588) (← links)
- Hypergraph coverings and local colorings (Q1121913) (← links)
- A contribution to the chromatic theory of uniform hypergraphs (Q1896647) (← links)
- On the construction of 3-chromatic hypergraphs with few edges (Q2349182) (← links)
- Colorings of partial Steiner systems and their applications (Q2515181) (← links)
- On the chromatic number of set systems (Q2748418) (← links)
- Coloring uniform hypergraphs with few edges (Q3055779) (← links)
- Coloring H-free hypergraphs (Q3055875) (← links)
- Random coloring method in the combinatorial problem of Erdős and Lovász (Q3119050) (← links)
- A note on random greedy coloring of uniform hypergraphs (Q3452724) (← links)
- Coloring uniform hypergraphs with few colors (Q4446874) (← links)
- Colourings of Uniform Hypergraphs with Large Girth and Applications (Q4643316) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- On the Chromatic Thresholds of Hypergraphs (Q5366886) (← links)
- Colorings of hypergraphs with large number of colors (Q5890912) (← links)
- Colorings of hypergraphs with large number of colors (Q5895162) (← links)
