3 papers
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
The density of graphs with no -path connecting equal-degree vertices: a short proof
Yamaan Attwa, Matías Azócar Carvajal, Simona Boyadzhiyska +2
Addressing a question posed by Chen and Ma from an asymptotic point of view, we present a short proof for the edge density needed to guarantee that two vertices of the same degree…
math.CO2024
Canonical Ramsey numbers for partite hypergraphs
Matías Azócar Carvajal, Giovanne Santos, Mathias Schacht
We show that canonical Ramsey numbers for partite hypergraphs grow single exponentially for any fixed uniformity.