49 citations · 158 across the 33 of their papers we have counts for
5 papers · 1 filter
Proof of a conjecture on induced subgraphs of Ramsey graphs
Matthew Kwan, Benny Sudakov
An n-vertex graph is called C-Ramsey if it has no clique or independent set of size C log n. All known constructions of Ramsey graphs involve randomness in an essential way, and th…
Ramsey graphs induce subgraphs of quadratically many sizes
Matthew Kwan, Benny Sudakov
An n-vertex graph is called C-Ramsey if it has no clique or independent set of size C log n. All known constructions of Ramsey graphs involve randomness in an essential way, and th…
Counting Hamilton cycles in sparse random directed graphs
Asaf Ferber, Matthew Kwan, Benny Sudakov
Let D(n,p) be the random directed graph on n vertices where each of the n(n-1) possible arcs is present independently with probability p. A celebrated result of Frieze shows that i…
The random k-matching-free process
Michael Krivelevich, Matthew Kwan, Po-Shen Loh +1
Let be a graph property which is preserved by removal of edges, and consider the random graph process that starts with the empty -vertex graph and then adds edges…
Non-trivially intersecting multi-part families
Matthew Kwan, Benny Sudakov, Pedro Vieira
We say a family of sets is intersecting if any two of its sets intersect, and we say it is trivially intersecting if there is an element which appears in every set of the family. I…