49 citations · 158 across the 33 of their papers we have counts for
6 papers · 1 filter
Acyclic subgraphs of tournaments with high chromatic number
Jacob Fox, Matthew Kwan, Benny Sudakov
We prove that every -vertex tournament has an acyclic subgraph with chromatic number at least , while there exists an -vertex tournament whose every acy…
Universality of random permutations
Xiaoyu He, Matthew Kwan
It is a classical fact that for any , a random permutation of length typically contains a monotone subsequence of length . As a…
An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs
Matthew Kwan, Lisa Sauermann
Consider a quadratic polynomial of independent Bernoulli random variables. What can be said about the concentration of on any single value? Th…
Almost all Steiner triple systems are almost resolvable
Asaf Ferber, Matthew Kwan
We show that for any n divisible by 3, almost all order-n Steiner triple systems admit a decomposition of almost all their triples into disjoint perfect matchings (that is, almost…
Anticoncentration for subgraph counts in random graphs
Jacob Fox, Matthew Kwan, Lisa Sauermann
Fix a graph and some , and let be the number of copies of in a random graph . Random variables of this form have been intensively studied since th…
Combinatorial anti-concentration inequalities, with applications
Jacob Fox, Matthew Kwan, Lisa Sauermann
We prove several different anti-concentration inequalities for functions of independent Bernoulli-distributed random variables. First, motivated by a conjecture of Alon, Hefetz, Kr…