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

3 papers · 1 filter

math.CO2015★ 1 cited

Boolean lattices: Ramsey properties and embeddings

Maria Axenovich, Stefan Walzer

A subposet $Q^{'}$ of a poset $Q$ is a copy of a poset $P$ if there is a bijection $f$ between elements of $P$ and $Q^{'}$ such that $x \leq y$ in $P$ iff $f (x) \leq f (y)$ in $Q^{'}$ . For pos…

math.CO2015

Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths

Maria Axenovich, Torsten Ueckerdt, Pascal Weiner

Recently, Borodin, Kostochka, and Yancey (On $1$ -improper $2$ -coloring of sparse graphs. Discrete Mathematics, 313(22), 2013) showed that the vertices of each planar graph of girth…

math.CO2015★ 1 cited

Conditions on Ramsey non-equivalence

Maria Axenovich, Jonathan Rollin, Torsten Ueckerdt

Given a graph H, a graph G is called a Ramsey graph of H if there is a monochromatic copy of H in every coloring of the edges of G with two colors. Two graphs G, H are called Ramse…