On Extremal Hypergraphs for Hamiltonian Cycles. - Roman Glebov; Yury Person; Wilma Weps (Electron. Notes Discret. Math., 2011)

Bijective mapping preserving intersecting antichains for k-valued cubes. - Roman Glebov (Discret. Math., 2012)

The Biased Odd Cycle Game. - Asaf Ferber; Roman Glebov; Michael Krivelevich; Hong Liu 010; Cory Palmer; Tomás Valla; Máté Vizer (Electron. J. Comb., 2013)

An application of flag algebras to a problem of Erdős and Sós. - Roman Glebov; Daniel Král'; Jan Volec (Electron. Notes Discret. Math., 2013)

On the Number of Hamilton Cycles in Sparse Random Graphs. - Roman Glebov; Michael Krivelevich (SIAM J. Discret. Math., 2013)

How Many Colors Guarantee a Rainbow Matching? - Roman Glebov; Benny Sudakov; Tibor Szabó (Electron. J. Comb., 2014)

Large permutations and parameter testing. - Roman Glebov; Carlos Hoppen; Tereza Klimosová; Yoshiharu Kohayakawa; Daniel Král; Hong Liu 010 (CoRR, 2014)

Infinite dimensional finitely forcible graphon. - Roman Glebov; Tereza Klimosová; Daniel Král (CoRR, 2014)

Conflict-Free Colouring of Graphs. - Roman Glebov; Tibor Szabó; Gábor Tardos (Comb. Probab. Comput., 2014)

On covering expander graphs by hamilton cycles. - Roman Glebov; Michael Krivelevich; Tibor Szabó (Random Struct. Algorithms, 2014)

Comparable pairs in families of sets. - Noga Alon; Shagnik Das; Roman Glebov; Benny Sudakov (J. Comb. Theory B, 2015)

Finitely forcible graphons and permutons. - Roman Glebov; Andrzej Grzesik; Tereza Klimosová; Daniel Král (J. Comb. Theory B, 2015)

Biased games on random boards. - Asaf Ferber; Roman Glebov; Michael Krivelevich; Alon Naor (Random Struct. Algorithms, 2015)

Building Spanning Trees Quickly in Maker-Breaker Games. - Dennis Clemens; Asaf Ferber; Roman Glebov; Dan Hefetz; Anita Liebenau (SIAM J. Discret. Math., 2015)

On the Concentration of the Domination Number of the Random Graph. - Roman Glebov; Anita Liebenau; Tibor Szabó (SIAM J. Discret. Math., 2015)

On the maximum number of Latin transversals. - Roman Glebov; Zur Luria (J. Comb. Theory A, 2016)

The Threshold Probability for Long Cycles. - Roman Glebov; Humberto Naves; Benny Sudakov (Comb. Probab. Comput., 2017)

Densities in large permutations and parameter testing. - Roman Glebov; Carlos Hoppen; Tereza Klimosová; Yoshiharu Kohayakawa; Daniel Král'; Hong Liu 010 (Eur. J. Comb., 2017)

Virtually Fibering Random Right-Angled Coxeter Groups - Extended Abstract. - Gonzalo Fiz Pontiveros; Roman Glebov; Ilan Karpas (Electron. Notes Discret. Math., 2018)

Colouring set families without monochromatic k-chains. - Shagnik Das; Roman Glebov; Benny Sudakov; Tuan Tran (J. Comb. Theory A, 2019)

Perfect matchings in random subgraphs of regular bipartite graphs. - Roman Glebov; Zur Luria; Michael Simkin (J. Graph Theory, 2021)

On the Local Structure of Oriented Graphs - a Case Study in Flag Algebras. - Shoni Gilboa; Roman Glebov; Dan Hefetz; Nati Linial; Avraham Morgenstern (Electron. J. Comb., 2022)