activity
20132022
most citedAbsolutely avoidable order-size pairs for induced subgraphs

1 citations · 2 across the 11 of their papers we have counts for

collaborators

28 papers

math.CO2022

Extremal numbers for cycles in a hypercube

Maria Axenovich

Let be the largest number of edges in a subgraph of a hypercube such that there is no subgraph of isomorphic to . We show that for any integer $k\geq…

math.CO20221 cited

Interval colorings of graphs -- coordinated and unstable no-wait schedules

Maria Axenovich, Michael Zheng

A proper edge-coloring of a graph is an interval coloring if the labels on the edges incident to any vertex form an interval of consecutive integers. Interval thickness s(G) of a g…

math.CO2022

Generalized Turán densities in the hypercube

Maria Axenovich, Laurin Benz, David Offner +1

A classical extremal, or Turán-type problem asks to determine , the largest number of edges in a subgraph of a graph which does not contain a subgraph isomorphi…

math.CO2021

Poset Ramsey numbers: large Boolean lattice versus a fixed poset

Maria Axenovich, Christian Winter

Given partially ordered sets (posets) and , we say that contains a copy of if for some injective function and for any $…

math.CO2021

Canonical theorems for colored integers with respect to some linear combinations

Maria Axenovich, David S. Gunderson, Hanno Lefmann

Hindman proved in 1979 that no matter how natural numbers are colored in r colors, for a fixed positive integer r, there is an infinite subset X of numbers and a color t such that…

math.CO20211 cited

Absolutely avoidable order-size pairs for induced subgraphs

Maria Axenovich, Lea Weber

We call a pair of integers, , , \emph{absolutely avoidable} if there is such that for any pair of integers with an…