1 citations · 2 across the 2 of their papers we have counts for
6 papers
Conditions for a bigraph to be super-cyclic
Alexandr Kostochka, Mikhail Lavrov, Ruth Luo +1
A hypergraph is super-pancyclic if for each with , contains a Berge cycle with base vertex set . We present two…
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 -connected hypergraph with has a h…
Long monochromatic paths and cycles in 2-edge-colored multipartite graphs
József Balogh, Alexandr Kostochka, Mikhail Lavrov +1
We solve four similar problems: For every fixed and large , we describe all values of such that for every -edge-coloring of the complete -partite grap…
Ordered Size Ramsey Number of Paths
József Balogh, Felix Christian Clemen, Emily Heath +1
An ordered graph is a simple graph with an ordering on its vertices. Define the ordered path to be the monotone increasing path with edges. The ordered size Ramsey number…
Monochromatic Hilbert cubes and arithmetic progressions
József Balogh, Mikhail Lavrov, George Shakan +1
The Van der Waerden number denotes the smallest such that whenever is --colored there exists a monochromatic arithmetic progression of length . Similarly,…
An upper bound for the Hales-Jewett number HJ(4,2)
Mikhail Lavrov
We show that for at least , any 2-coloring of the -dimensional grid contains a monochromatic combinatorial line. This is a special case of the Hales-Jewett…