12 citations · 50 across the 21 of their papers we have counts for
25 papers
On the local structure of oriented graphs -- a case study in flag algebras
Shoni Gilboa, Roman Glebov, Dan Hefetz +2
Let be an -vertex oriented graph. Let (respectively ) be the probability that a random set of vertices of spans a transitive triangle (respectively an i…
Perfect Matchings in Random Subgraphs of Regular Bipartite Graphs
Roman Glebov, Zur Luria, Michael Simkin
Consider the random process in which the edges of a graph are added one by one in a random order. A classical result states that if is the complete graph or the co…
Colouring set families without monochromatic k-chains
Shagnik Das, Roman Glebov, Benny Sudakov +1
A coloured version of classic extremal problems dates back to Erdős and Rothschild, who in 1974 asked which -vertex graph has the maximum number of 2-edge-colourings without mon…
Virtually fibering random right-angled Coxeter groups
Gonzalo Fiz Pontiveros, Roman Glebov, Ilan Karpas
We show that the Right-Angled Coxeter group associated to a random graph with virtual…
Densities of 3-vertex graphs
Roman Glebov, Andrzej Grzesik, Ping Hu +3
Let d_i(G) be the density of the 3-vertex i-edge graph in a graph G, i.e., the probability that three random vertices induce a subgraph with i edges. Let S be the set of all quadru…
The number of Hamiltonian decompositions of regular graphs
Roman Glebov, Zur Luria, Benny Sudakov
A Hamilton cycle in a graph is a cycle passing through every vertex of . A Hamiltonian decomposition of is a partition of its edge set into disjoint Hamilton cycles. One…