26 citations · 106 across the 27 of their papers we have counts for
6 papers · 1 filter
Dense induced bipartite subgraphs in triangle-free graphs
Matthew Kwan, Shoham Letzter, Benny Sudakov +1
The problem of finding dense induced bipartite subgraphs in -free graphs has a long history, and was posed 30 years ago by Erdős, Faudree, Pach and Spencer. In this paper, we ob…
Nearly-linear monotone paths in edge-ordered graphs
Matija Bucic, Matthew Kwan, Alexey Pokrovskiy +3
How long a monotone path can one always find in any edge-ordering of the complete graph ? This appealing question was first asked by Chvátal and Komlós in 1971, and has since…
Anticoncentration for subgraph statistics
Matthew Kwan, Benny Sudakov, Tuan Tran
Consider integers such that . Given a large graph , what is the fraction of -vertex subsets of which span exactly edges? When $G…
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…
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…
Minimum saturated families of sets
Matija Bucić, Shoham Letzter, Benny Sudakov +1
We call a family of subsets of -saturated if it contains no pairwise disjoint sets, and moreover no set can be added to while preserving th…