M. Axenovich

activity

20062026

most citedOn the editing distance of graphs

33 citations · 164 across the 61 of their papers we have counts for

collaborators

Showing 2026Show all

5 papers · 1 filter

math.CO2026

Non-isomorphic graphs have distinct vertex-Ramsey classes

Maria Axenovich, Patrick Schmitteckert

For a graph $H$ , its $k$ -colour vertex Ramsey class is the set of all graphs $G$ such that any colouring of the vertices of $G$ in $k$ colours results in a monochromatic (induced)…

math.CO2026

On high-girth layered graphs of large Turán density in a hypercube

Maria Axenovich, Marko Pejić

For a graph $H$ , let $ex (Q_{n}, H)$ be the largest number of edges in a subgraph of the hypercube $Q_{n}$ of dimension $n$ that contains no subgraph isomorphic to $H$ . W…

math.CO2026

Vertex-Ramsey theorems for Cartesian powers of graphs

Nóra Almási, Maria Axenovich, Arsenii Sagdeev

For graphs $G, H$ and positive integers $r$ and $n$ we write $G^{□ n} r H$ if every $r$ -vertex-coloring of the Cartesian power $G^{□ n}$ of $G$ contains a…

math.CO2026

Largest density of a layered subgraph of a hypercube

Maria Axenovich, Arsenii Sagdeev

Let $L (t)$ denote the largest number of edges induced by $t$ vertices from two vertex layers of a hypercube. We show that $$\frac14 t\log_2 t+\frac18 t\log_2\log_2 t-O(t) \leq L(t)…

math.CO2026

A note on Ramsey numbers for minors

Maria Axenovich, Raphael Steiner

Let $R_{h} (k; ℓ)$ be the smallest integer $n$ such that any edge coloring of a complete graph on $n$ vertices in $ℓ$ colors results in a monochromatic $K_{k}$ -minor, in other wor…