33 citations · 164 across the 61 of their papers we have counts for
5 papers · 1 filter
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…
Rainbow Subgraphs in Edge-colored Complete Graphs -- Answering two Questions by Erdős and Tuza
Maria Axenovich, Felix Christian Clemen
An edge-coloring of a complete graph with a set of colors is called completely balanced if any vertex is incident to the same number of edges of each color from . Erdős and…
Unavoidable order-size pairs in hypergraphs -- positive forcing density
Maria Axenovich, József Balogh, Felix Christian Clemen +1
Erdős, Füredi, Rothschild and Sós initiated a study of classes of graphs that forbid every induced subgraph on a given number of vertices and number of edges. Extending the…
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…
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…