Pages that link to "Item:Q2352063"
From MaRDI portal
The following pages link to Around Erdős-Lovász problem on colorings of non-uniform hypergraphs (Q2352063):
Displaying 13 items.
- Extremal problems for colorings of simple hypergraphs and applications (Q322292) (← links)
- Equitable colorings of non-uniform simple hypergraphs (Q322355) (← links)
- Equitable colorings of nonuniform hypergraphs (Q325641) (← links)
- On the construction of non-2-colorable uniform hypergraphs (Q476325) (← links)
- Coloring non-uniform hypergraphs without short cycles (Q742641) (← links)
- Applications of hypergraph coloring to coloring graphs not inducing certain trees (Q1916109) (← links)
- Upper bound in the Erdős-Hajnal problem of hypergraph coloring (Q1947784) (← links)
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph (Q2671957) (← links)
- On colorings of non-uniform hypergraphs without short cycles (Q2857438) (← links)
- On edge coloring of hypergraphs and Erdős-Faber-Lovász conjecture (Q2905303) (← links)
- Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (Q4521547) (← links)
- A note on two-colorability of nonuniform hypergraphs (Q5002721) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)