12 citations · 50 across the 21 of their papers we have counts for
5 papers · 1 filter
Bijective mapping preserving intersecting antichains for k-valued cubes
Roman Glebov
Generalizing a result of Miyakawa, Nozaki, Pogosyan and Rosenberg, we prove that there is a one-to-one correspondence between the set of intersecting antichains in a subset of the…
Extremal graphs for clique-paths
Roman Glebov
In this paper we deal with a Turán-type problem: given a positive integer n and a forbidden graph H, how many edges can there be in a graph on n vertices without a subgraph H? How…
On extremal hypergraphs for hamiltonian cycles
Roman Glebov, Yury Person, Wilma Weps
We study sufficient conditions for Hamiltonian cycles in hypergraphs, and obtain both Turán- and Dirac-type results. While the Turán-type result gives an exact threshold for the ap…
On covering expander graphs by Hamilton cycles
Roman Glebov, Michael Krivelevich, Tibor Szabó
The problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In this paper, we look at the dual question of covering all edges of a graph…
Conflict-free coloring of graphs
Roman Glebov, Tibor Szabó, Gábor Tardos
We study the conflict-free chromatic number chi_{CF} of graphs from extremal and probabilistic point of view. We resolve a question of Pach and Tardos about the maximum conflict-fr…