33 citations · 164 across the 61 of their papers we have counts for
5 papers · 1 filter
Strong complete minors in digraphs
Maria Axenovich, António Girão, Richard Snyder +1
Kostochka and Thomason independently showed that any graph with average degree contains a minor. In particular, any graph with chromatic number $Ω(r\sqrt{…
Splits with forbidden subgraphs
Maria Axenovich, Ryan R. Martin
In this note, we fix a graph and ask into how many vertices can each vertex of a clique of size can be "split" such that the resulting graph is -free. Formally: A graph…
The Erdős-Hajnal conjecture for three colors and multiple forbidden patterns
Maria Axenovich, Richard Snyder, Lea Weber
Erdős and Szekeres's quantitative version of Ramsey's theorem asserts that any complete graph on n vertices that is edge-colored with two colors has a monochromatic clique on at le…
Bipartite independence number in graphs with bounded maximum degree
Maria Axenovich, Jean-Sébastien Sereni, Richard Snyder +1
We consider a natural, yet seemingly not much studied, extremal problem in bipartite graphs. A bi-hole of size in a bipartite graph is a copy of in the bipartite…
Induced Ramsey number for a star versus a fixed graph
Maria Axenovich, Izolda Gorgol
For graphs G and H, let the induced Ramsey number IR(H,G) be the smallest number of vertices in a graph F such that any coloring of the edges of F in red and blue, there is either…