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 2024Show all

7 papers · 1 filter

math.CO2024

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.CO2024

On hypercube statistics

Noga Alon, Maria Axenovich, John Goldwasser

Let $d \geq 1$ and $s \leq 2^{d}$ be nonnegative integers. For a subset $A$ of vertices of the hypercube $Q_{n}$ and $n \geq d$ , let $λ (n, d, s, A)$ denote the fraction of subcubes $Q_{d}$ o…

math.CO2024

Faces in girth-saturated graphs on surfaces

Maria Axenovich, Leon Kießle, Arsenii Sagdeev +1

What is the maximum length $f_{max} (ℓ, Σ)$ of a facial cycle of an inclusion-maximal graph with girth at least $ℓ$ embedded on a given surface $Σ$ ? If $Σ=\mathcal{P…

math.CO2024

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 avo…

math.CO2024

Diagonal poset Ramsey numbers

Maria Axenovich, Christian Winter

A poset $(Q, \leq_{Q})$ contains an induced copy of a poset $(P, \leq_{P})$ if there exists an injective mapping $ϕ : P \to Q$ such that for any two elements $X, Y \in P$ , $X \leq_{P} Y$ if a…

math.CO2024★ 1 cited

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.CO2024

Induced Turán problem in bipartite graphs

Maria Axenovich, Jakob Zimmermann

The classical extremal function for a graph $H$ , $e x (K_{n}, H)$ is the largest number of edges in a subgraph of $K_{n}$ that contains no subgraph isomorphic to $H$ . Note that defining…