33 citations · 164 across the 61 of their papers we have counts for
7 papers · 1 filter
Planar Ramsey graphs
Maria Axenovich, Carsten Thomassen, Ursula Schade +1
We say that a graph is planar unavoidable if there is a planar graph such that any red/blue coloring of the edges of contains a monochromatic copy of , otherwise we…
A note on saturation for Berge-G hypergraphs
Maria Axenovich, Christian Winter
For a graph G, a hypergraph H is called Berge-G if there is a hypergraph H', isomorphic to H, containing all vertices of G, so that e is contained in f(e) for each edge e of G, whe…
On induced Ramsey numbers for multiple copies of graphs
Maria Axenovich, Izolda Gorgol
We say that a graph F strongly arrows a pair of graphs (G,H) if any colouring of its edges with red and blue leads to either a red G or a blue H appearing as induced subgraphs of F…
Clumsy packings of graphs
Maria Axenovich, Anika Kaufmann, Raphael Yuster
Let and be graphs. We say that is an -packing of if is a set of edge-disjoint copies of in . An -packing is maximal if there is no other -pa…
A note on Ramsey numbers for Berge-G hyper graphs
Maria Axenovich, Andras Gyarfas
For a graph G=(V,E), a hypergraph H is called Berge-G if there is a bijection f from E(G) to E(H) such that for each e in E(G), e is a subset of f(e). The set of all Berge-G hyperg…
Induced Saturation of Graphs
Maria Axenovich, Mónika Csikós
A graph is -saturated for a graph , if does not contain a copy of but adding any new edge to results in such a copy. An -saturated graph on a given number…
Induced and Weak Induced Arboricities
Maria Axenovich, Philip Dörr, Jonathan Rollin +1
We define the induced arboricity of a graph , denoted by , as the smallest such that the edges of can be covered with induced forests in . This notio…