Pages that link to "Item:Q2435805"
From MaRDI portal
The following pages link to Combinatorial extremum problems for 2-colorings of hypergraphs (Q2435805):
Displaying 4 items.
- 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)
- On the hypercompetition numbers of hypergraphs with maximum degree at most two (Q2516687) (← links)
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph (Q2671957) (← links)