22 citations · 51 across the 21 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
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…
math.CO2018★ 6 cited
Structure and Supersaturation for Intersecting Families
József Balogh, Shagnik Das, Hong Liu +2
The extremal problems regarding the maximum possible size of intersecting families of various combinatorial objects have been extensively studied. In this paper, we investigate sup…