| Publication | Date of Publication | Type |
|---|
Subspace coverings with multiplicities
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
Schur properties of randomly perturbed sets
European Journal of Combinatorics | 2024-09-30 | Paper |
Strong blocking sets and minimal codes from expander graphs
Transactions of the American Mathematical Society | 2024-07-12 | Paper |
Covering grids with multiplicity
Combinatorial Theory | 2024-04-02 | Paper |
Tight bounds for divisible subdivisions
Journal of Combinatorial Theory. Series B | 2024-01-15 | Paper |
| Stability for hyperplane covers | 2023-06-13 | Paper |
| Strong blocking sets and minimal codes from expander graphs | 2023-05-24 | Paper |
| Schur properties of randomly perturbed sets | 2022-05-03 | Paper |
Isomorphic bisections of cubic graphs
Journal of Combinatorial Theory. Series B | 2021-09-16 | Paper |
| Ramsey simplicity of random graphs | 2021-09-09 | Paper |
Ramsey properties of randomly perturbed graphs: cliques and cycles
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
Ryser's conjecture for \(t\)-intersecting hypergraphs
Journal of Combinatorial Theory. Series A | 2021-02-03 | Paper |
| Subspace coverings with multiplicities | 2021-01-28 | Paper |
Vertex Ramsey properties of randomly perturbed graphs
Random Structures & Algorithms | 2021-01-05 | Paper |
Ramsey games near the critical threshold
Random Structures & Algorithms | 2021-01-05 | Paper |
Enumerating extensions of mutually orthogonal Latin squares
Designs, Codes and Cryptography | 2020-10-07 | Paper |
Small arrays of maximum coverage
Journal of Combinatorial Designs | 2018-11-23 | Paper |
Sperner's theorem and a problem of Erdős, Katona and Kleitman
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
The minimum number of disjoint pairs in set systems and related problems
Combinatorica | 2017-04-25 | Paper |
| A Semi-Random Construction of Small Covering Arrays | 2017-03-15 | Paper |
| A simple removal lemma for large nearly-intersecting families | 2016-10-14 | Paper |
Almost-Fisher families
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Removal and stability for Erdős-Ko-Rado
SIAM Journal on Discrete Mathematics | 2016-05-26 | Paper |
Comparable pairs in families of sets
Journal of Combinatorial Theory. Series B | 2015-08-21 | Paper |
Most probably intersecting hypergraphs
The Electronic Journal of Combinatorics | 2015-04-22 | Paper |
Most probably intersecting hypergraphs
The Electronic Journal of Combinatorics | 2015-04-22 | Paper |
Intersecting families of discrete structures are typically trivial
Journal of Combinatorial Theory. Series A | 2015-02-27 | Paper |
A problem of Erdős on the minimum number of \(k\)-cliques
Journal of Combinatorial Theory. Series B | 2014-10-06 | Paper |
Rainbow Turán problem for even cycles
European Journal of Combinatorics | 2013-03-19 | Paper |
Bounded fractional intersecting families are linear in size
(available as arXiv preprint) | N/A | Paper |
