Publications (22)
A problem of Erdos and Sos on 3-graphs
Roman Glebov, Daniel Kral, Jan Volec
On covering expander graphs by Hamilton cycles
Roman Glebov, Michael Krivelevich, Tibor Szabó
On the Concentration of the Domination Number of the Random Graph
Roman Glebov, Anita Liebenau, Tibor Szabó
Compactness and finite forcibility of graphons
Roman Glebov, Daniel Kral, Jan Volec
Infinite dimensional finitely forcible graphon
Roman Glebov, Tereza Klimosova, Daniel Kral
On the maximum number of Latin transversals
Roman Glebov, Zur Luria
Building spanning trees quickly in Maker-Breaker games
Dennis Clemens, Asaf Ferber, Roman Glebov +2
Biased Games On Random Boards
Asaf Ferber, Roman Glebov, Michael Krivelevich +1
Densities in large permutations and parameter testing
Roman Glebov, Carlos Hoppen, Tereza Klimosova +3
Virtually fibering random right-angled Coxeter groups
Gonzalo Fiz Pontiveros, Roman Glebov, Ilan Karpas
The number of Hamiltonian decompositions of regular graphs
Roman Glebov, Zur Luria, Benny Sudakov
Conflict-free coloring of graphs
Roman Glebov, Tibor Szabó, Gábor Tardos
Extremal graphs for clique-paths
Roman Glebov
Colouring set families without monochromatic k-chains
Shagnik Das, Roman Glebov, Benny Sudakov +1
The threshold probability for long cycles
Roman Glebov, Humberto Naves, Benny Sudakov
How many colors guarantee a rainbow matching?
Roman Glebov, Benny Sudakov, Tibor Szabó
Bijective mapping preserving intersecting antichains for k-valued cubes
Roman Glebov
Finitely forcible graphons and permutons
Roman Glebov, Andrzej Grzesik, Tereza Klimosova +1
On extremal hypergraphs for hamiltonian cycles
Roman Glebov, Yury Person, Wilma Weps
Densities of 3-vertex graphs
Roman Glebov, Andrzej Grzesik, Ping Hu +3
Comparable pairs in families of sets
Noga Alon, Shagnik Das, Roman Glebov +1
The biased odd cycle game
Asaf Ferber, Roman Glebov, Michael Krivelevich +4