Pages that link to "Item:Q4446874"
From MaRDI portal
The following pages link to Coloring uniform hypergraphs with few colors (Q4446874):
Displaying 28 items.
- Colorful subhypergraphs in uniform hypergraphs (Q510336) (← 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)
- On the chromatic number of simple triangle-free triple systems (Q1010856) (← links)
- On the chromatic number of finite systems of subsets (Q1034015) (← links)
- Hypergraph coverings and local colorings (Q1121913) (← links)
- On proper colorings of hypergraphs (Q1930218) (← links)
- Coloring hypergraphs of low connectivity (Q2073648) (← links)
- Uniform mixed hypergraphs: the possible numbers of colors (Q2482347) (← links)
- Coloring \(d\)-embeddable \(k\)-uniform hypergraphs (Q2514227) (← links)
- Equitable colorings of hypergraphs with \(r\) colors (Q2671950) (← links)
- On the problem of Erdős and Hajnal in the case of list colorings (Q2851493) (← links)
- Greedy colorings of uniform hypergraphs (Q3055773) (← links)
- Coloring uniform hypergraphs with few edges (Q3055779) (← links)
- Coloring H-free hypergraphs (Q3055875) (← links)
- On proper colourings of hypergraphs using prescribed colours (Q3057818) (← links)
- (Q3060863) (← 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)
- Multipass greedy coloring of simple uniform hypergraphs (Q3467582) (← links)
- Minimal uniquely colourable hypergraphs (Q3972514) (← links)
- Approximate coloring of uniform hypergraphs (Q4820902) (← links)
- DOWNWARD UNARY COLORINGS (Q5055024) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- Colorings of hypergraphs with large number of colors (Q5890912) (← links)
- Colorings of hypergraphs with large number of colors (Q5895162) (← links)
