Pages that link to "Item:Q2297713"
From MaRDI portal
The following pages link to Coloring hypergraphs with bounded cardinalities of edge intersections (Q2297713):
Displaying 7 items.
- Coloring 2-intersecting hypergraphs (Q396868) (← links)
- Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees (Q1045172) (← 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 uniform hypergraphs with few edges (Q3055779) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- Proper colorability of segment intersection graphs (Q6168981) (← links)