The following pages link to Sergei Kiselev (Q2075510):
Displaying 8 items.
- On the maximum number of distinct intersections in an intersecting family (Q2075511) (← links)
- Best possible bounds on the number of distinct differences in intersecting families (Q2080226) (← links)
- VC-saturated set systems (Q2143393) (← links)
- Sharp bounds for the chromatic number of random Kneser graphs (Q2171013) (← links)
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (Q2422241) (← links)
- Rainbow matchings in k‐partite hypergraphs (Q4996918) (← links)
- Independence numbers of Johnson-type graphs (Q6115445) (← links)
- Trivial colors in colorings of Kneser graphs (Q6197737) (← links)
