Mikhail Lavrov

According to our database1, Mikhail Lavrov authored at least 13 papers between 2013 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Longest cycles in 3-connected hypergraphs and bipartite graphs.
J. Graph Theory, 2022

Monochromatic connected matchings in 2-edge-colored multipartite graphs.
J. Graph Theory, 2022

A strengthening of the Erdős-Szekeres Theorem.
Eur. J. Comb., 2022

Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree.
Comb. Probab. Comput., 2022

2021
Making Kr+1-free graphs r-partite.
Comb. Probab. Comput., 2021

Conditions for a Bigraph to be Super-Cyclic.
Electron. J. Comb., 2021

2020
Ordered size Ramsey number of paths.
Discret. Appl. Math., 2020

2019
Distance-Uniform Graphs with Large Diameter.
SIAM J. Discret. Math., 2019

Monochromatic Hilbert Cubes and Arithmetic Progressions.
Electron. J. Comb., 2019

2016
An Upper Bound for the Hales-Jewett Number $\mathrm{HJ}(4, 2)$.
SIAM J. Discret. Math., 2016

Increasing Hamiltonian paths in random edge orderings.
Random Struct. Algorithms, 2016

2014
Improved upper and lower bounds on a geometric Ramsey problem.
Eur. J. Comb., 2014

2013
On the Game Chromatic Number of Sparse Random Graphs.
SIAM J. Discret. Math., 2013


  Loading...