Showing 2026Show all
2 papers · 1 filter
math.CO2026
Canonical Ramsey theorem for graphs with clean intersections
Matías Azócar Carvajal, Ayush Basu, Christian Reiher +3
Extending earlier results of Nešetřil and Rödl [Selective graphs and hypergraphs, Ann. Discrete Math. 3 (1978), 181--189], we show that for every ordered graph there exist an o…
math.CO2026
On Ramsey number of Steiner systems
Ayush Basu, Daniel Dobak, Vojtěch Rödl +1
A -uniform hypergraph is called a partial -system if every set of vertices of is contained in at most one edge of . We prove the existence of a pa…