Pages that link to "Item:Q3055779"
From MaRDI portal
The following pages link to Coloring uniform hypergraphs with few edges (Q3055779):
Displayed 20 items.
- Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number (Q268128) (← links)
- Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees (Q311513) (← links)
- Extremal problems for colorings of simple hypergraphs and applications (Q322292) (← links)
- 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)
- Improved algorithms for colorings of simple hypergraphs and applications (Q896005) (← links)
- Colorings of \(b\)-simple hypergraphs (Q1689874) (← links)
- New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\) (Q2088728) (← links)
- 2-colorings of hypergraphs with large girth (Q2197249) (← links)
- Coloring hypergraphs with bounded cardinalities of edge intersections (Q2297713) (← links)
- DP-colorings of hypergraphs (Q2422217) (← links)
- Colorings of partial Steiner systems and their applications (Q2515181) (← links)
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph (Q2671957) (← links)
- Constructions of sparse uniform hypergraphs with high chromatic number (Q3055877) (← links)
- Random coloring method in the combinatorial problem of Erdős and Lovász (Q3119050) (← links)
- Multipass greedy coloring of simple uniform hypergraphs (Q3467582) (← links)
- Colourings of Uniform Hypergraphs with Large Girth and Applications (Q4643316) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
