Mikhail Lavrov

activity

20112025

K_{r + 1}

-Free Graphs

r

-partite

10 citations · 19 across the 14 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

math.CO2020

Conditions for a bigraph to be super-cyclic

Alexandr Kostochka, Mikhail Lavrov, Ruth Luo +1

A hypergraph $H$ is super-pancyclic if for each $A \subseteq V (H)$ with $∣ A ∣ \geq 3$ , $H$ contains a Berge cycle with base vertex set $A$ . We present two…

math.CO2020

A Strengthening of the Erdős-Szekeres Theorem

József Balogh, Felix Christian Clemen, Emily Heath +1

The Erdős-Szekeres Theorem stated in terms of graphs says that any red-blue coloring of the edges of the ordered complete graph $K_{r s + 1}$ contains a red copy of the monotone incre…

math.CO2020

Longest cycles in 3-connected hypergraphs and bipartite graphs

Alexandr Kostochka, Mikhail Lavrov, Ruth Luo +1

In the language of hypergraphs, our main result is a Dirac-type bound: we prove that every $3$ -connected hypergraph $H$ with $δ (H) \geq max {∣ V (H) ∣, \frac{∣ E ( H ) ∣ + 10}{4}}$ has a h…