M. Axenovich

collaborators

12 papers

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

Chromatic Ramsey numbers and two-color TurÃ¡n densities

Maria Axenovich, Simon Gaa, Dingyuan Liu

Given a graph $G$ , its $2$ -color TurÃ¡n number $ex^{(2)} (n, G)$ is the maximum number of edges in an $n$ -vertex graph, such that the edges can be colored with two colors av…

math.CO2026

A note on the mutual-visibility coloring of hypercubes

Maria Axenovich, Dingyuan Liu

A subset $M$ of vertices in a graph $G$ is a mutual-visibility set if for any two vertices $u, v \in M$ there exists a shortest $u$ - $v$ path in $G$ that contains no elements of $M$ …

math.CO2026

Visibility in hypercubes

Maria Axenovich, Dingyuan Liu

A subset $M$ of vertices in a graph $G$ is a mutual-visibility set if any two vertices $u$ and $v$ in $M$ ``see'' each other in $G$ , that is, there exists a shortest $u, v$ -path in…

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…