12 citations · 50 across the 21 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018
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…
math.CO2018★ 5 cited
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…