33 citations · 164 across the 61 of their papers we have counts for
4 papers · 1 filter
Ramsey problems for graphs in Euclidean spaces and Cartesian powers
Maria Axenovich, Dingyuan Liu, Arsenii Sagdeev
Given a graph , let be the smallest positive integer such that there exists an -coloring of with no monochromatic unit-copy of , tha…
Online Ramsey turnaround numbers
Nóra Almási, Maria Axenovich
The online Ramsey turnaround game is a game between two players, Builder and Painter, on a board of vertices using colors, for a fixed graph on at most vertices. Th…
An improved upper bound for the multicolour Ramsey number of odd cycles
Maria Axenovich, Wouter Cames van Batenburg, Oliver Janzer +2
We show that the -colour Ramsey number of an odd cycle of length is at most . This proves a conjecture of Fox and is the first improvem…
Turán problems for simplicial complexes
Maria Axenovich, Dániel Gerbner, Dingyuan Liu +1
An abstract simplicial complex is a non-uniform hypergraph without isolated vertices, whose edge set is closed under taking subsets. The extremal number $\mathrm{ex}(n…