Pages that link to "Item:Q2338645"
From MaRDI portal
The following pages link to On small \(n\)-uniform hypergraphs with positive discrepancy (Q2338645):
Displaying 10 items.
- Lower bounds on the clique-chromatic numbers of some distance graphs (Q2043671) (← links)
- New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\) (Q2088728) (← links)
- The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets (Q2191992) (← links)
- New bounds on clique-chromatic numbers of Johnson graphs (Q2192124) (← links)
- 2-colorings of hypergraphs with large girth (Q2197249) (← links)
- New bounds for the clique-chromatic numbers of Johnson graphs (Q2243705) (← links)
- On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\) (Q2304365) (← links)
- On non-adaptive majority problems of large query size (Q5024678) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- Computational complexity of counting coincidences (Q6614012) (← links)
