| Publication | Date of Publication | Type |
|---|
Tight general bounds for the extremal numbers of 0-1 matrices
(available as arXiv preprint) | N/A | Paper |
Edge-disjoint cycles with the same vertex set
(available as arXiv preprint) | N/A | Paper |
Nearly Hamilton cycles in sublinear expanders and applications
Journal of the London Mathematical Society. Second Series | 2026-02-27 | Paper |
| A proof of the Erdős-Faber-Lovász conjecture: a survey | 2026-01-13 | Paper |
Packing subgraphs in regular graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
The independence number of uncrowded hypergraphs: bounds matching the shattering threshold
(available as arXiv preprint) | 2026-01-01 | Paper |
Long Directed Cycles in Vertex-Transitive Digraphs
(available as arXiv preprint) | 2026-01-01 | Paper |
A nearly linear bound for the Lovász conjecture
(available as arXiv preprint) | 2026-01-01 | Paper |
Counting hypergraphs without linear cycles of fixed length
(available as arXiv preprint) | 2026-01-01 | Paper |
Regular subgraphs at every density
Transactions of the American Mathematical Society | 2026-01-01 | Paper |
Random independent sets in uncrowded hypergraphs
(available as arXiv preprint) | 2026-01-01 | Paper |
Tight bounds for intersection-reverse sequences, edge-ordered graphs, and applications
Journal of the London Mathematical Society. Second Series | 2025-11-19 | Paper |
Power saving for the Brown-Erdős-Sós problem
Discrete Analysis | 2025-09-19 | Paper |
| A proof of the Erdös-Faber-Lovász conjecture: algorithmic aspects | 2025-08-13 | Paper |
Minimizing the number of complete bipartite graphs in a K_s-saturated graph
Discussiones Mathematicae. Graph Theory | 2025-05-12 | Paper |
Edge-disjoint cycles with the same vertex set
Advances in Mathematics | 2025-04-07 | Paper |
Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree
Proceedings of the London Mathematical Society. Third Series | 2025-01-09 | Paper |
Toward Vu's conjecture
(available as arXiv preprint) | 2025-01-01 | Paper |
Independent sets and colorings of $K_{t,t,t}$-free graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Cycles with many chords
Random Structures & Algorithms | 2024-11-20 | Paper |
Tight general bounds for the extremal numbers of 0-1 matrices
IMRN. International Mathematics Research Notices | 2024-10-31 | Paper |
The extremal number of cycles with all diagonals
IMRN. International Mathematics Research Notices | 2024-10-25 | Paper |
Adaptive majority problems for restricted query graphs and for weighted sets
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Edge ordered Turán problems
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
Generalized Turán problems for even cycles
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
Forum of Mathematics, Sigma | 2024-09-12 | Paper |
Rainbow subdivisions of cliques
Random Structures & Algorithms | 2024-03-25 | Paper |
On \(3\)-uniform hypergraphs avoiding a cycle of length four
The Electronic Journal of Combinatorics | 2024-02-16 | Paper |
Tight bounds for intersection-reverse sequences, edge-ordered graphs and applications
(available as arXiv preprint) | 2024-01-01 | Paper |
Regular subgraphs at every density
(available as arXiv preprint) | 2024-01-01 | Paper |
New bounds on the size of nearly perfect matchings in almost regular hypergraphs
Journal of the London Mathematical Society | 2023-12-19 | Paper |
| Power saving for the Brown-Erd\H{o}s-S\'os problem | 2023-11-21 | Paper |
Graph and hypergraph colouring via nibble methods: a survey
European Congress of Mathematics | 2023-11-10 | Paper |
Triangles in C5‐free graphs and hypergraphs of girth six
Journal of Graph Theory | 2023-10-04 | Paper |
Ramsey numbers of Boolean lattices
Bulletin of the London Mathematical Society | 2023-09-15 | Paper |
Ramsey numbers of Boolean lattices
Bulletin of the London Mathematical Society | 2023-09-15 | Paper |
A proof of the Erdős-Faber-Lovász conjecture
Annals of Mathematics. Second Series | 2023-09-06 | Paper |
| The extremal number of cycles with all diagonals | 2023-08-30 | Paper |
Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor
(available as arXiv preprint) | 2023-08-28 | Paper |
| Cycles with many chords | 2023-06-15 | Paper |
Rainbow Turán number of clique subdivisions
European Journal of Combinatorics | 2023-04-27 | Paper |
Turán problems for edge-ordered graphs
Journal of Combinatorial Theory. Series B | 2023-03-23 | Paper |
Counting cliques in 1-planar graphs
European Journal of Combinatorics | 2022-12-28 | Paper |
Rainbow Ramsey problems for the Boolean lattice
Order | 2022-10-21 | Paper |
| A proof of the Elliott-R\"{o}dl conjecture on hypertrees in Steiner triple systems | 2022-08-22 | Paper |
Generalized rainbow Turán problems
The Electronic Journal of Combinatorics | 2022-06-13 | Paper |
On the Turán number of the blow-up of the hexagon
SIAM Journal on Discrete Mathematics | 2022-06-03 | Paper |
The exact linear Turán number of the sail
The Electronic Journal of Combinatorics | 2022-04-04 | Paper |
Few \(H\) copies in \(F\)-saturated graphs
Journal of Graph Theory | 2022-03-31 | Paper |
Vertex Turán problems for the oriented hypercube
Acta Universitatis Sapientiae. Mathematica | 2022-03-01 | Paper |
| Solution to a problem of Erd\H{o}s on the chromatic index of hypergraphs with bounded codegree | 2021-10-12 | Paper |
Rainbow Tur\'an number of clique subdivisions
(available as arXiv preprint) | 2021-06-25 | Paper |
Avoiding long Berge cycles: the missing cases \(k=r+1\) and \(k=r+2\)
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
On subgraphs of \(C_{2k}\)-free graphs and a problem of Kühn and Osthus
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
| Minimizing the number of complete bipartite graphs in a K_s-saturated graph | 2021-01-02 | Paper |
Adaptive majority problems for restricted query graphs and for weighted sets
Discrete Applied Mathematics | 2020-11-02 | Paper |
Edge colorings of graphs without monochromatic stars
Discrete Mathematics | 2020-10-08 | Paper |
Generalized Turán problems for even cycles
Journal of Combinatorial Theory. Series B | 2020-09-24 | Paper |
Generalized Turán problems for even cycles
Journal of Combinatorial Theory. Series B | 2020-09-24 | Paper |
New bounds for a hypergraph bipartite Turán problem
Journal of Combinatorial Theory. Series A | 2020-09-07 | Paper |
Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
European Journal of Combinatorics | 2020-06-16 | Paper |
Set systems related to a house allocation problem
Discrete Mathematics | 2020-05-21 | Paper |
Set systems related to a house allocation problem
Discrete Mathematics | 2020-05-21 | Paper |
3-uniform hypergraphs without a cycle of length five
The Electronic Journal of Combinatorics | 2020-05-20 | Paper |
General lemmas for Berge-Turán hypergraph problems
European Journal of Combinatorics | 2020-04-09 | Paper |
On clique coverings of complete multipartite graphs
Discrete Applied Mathematics | 2020-04-01 | Paper |
On clique coverings of complete multipartite graphs
Discrete Applied Mathematics | 2020-04-01 | Paper |
Turán number of an induced complete bipartite graph plus an odd cycle
Combinatorics, Probability and Computing | 2020-03-11 | Paper |
Ramsey problems for Berge hypergraphs
SIAM Journal on Discrete Mathematics | 2020-02-13 | Paper |
A simple proof for a forbidden subposet problem
The Electronic Journal of Combinatorics | 2020-01-27 | Paper |
On the number of containments in \(P\)-free families
Graphs and Combinatorics | 2020-01-21 | Paper |
Tur\'an problems for Edge-ordered graphs
(available as arXiv preprint) | 2020-01-03 | Paper |
Forbidding rank-preserving copies of a poset
Order | 2019-12-13 | Paper |
On the weight of Berge-\(F\)-free hypergraphs
The Electronic Journal of Combinatorics | 2019-10-14 | Paper |
On the weight of Berge-\(F\)-free hypergraphs
The Electronic Journal of Combinatorics | 2019-10-14 | Paper |
Generalized Turán problems for disjoint copies of graphs
Discrete Mathematics | 2019-09-11 | Paper |
Asymptotics for the Turán number of Berge-\(K_{2,t}\)
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
Saturation of Berge hypergraphs
Discrete Mathematics | 2019-06-27 | Paper |
Linearity of saturation for Berge hypergraphs
European Journal of Combinatorics | 2019-06-18 | Paper |
An improvement on the maximum number of k-dominating independent sets
Journal of Graph Theory | 2019-06-14 | Paper |
Stability results for vertex Turán problems in Kneser graphs
The Electronic Journal of Combinatorics | 2019-05-20 | Paper |
Stability results for vertex Turán problems in Kneser graphs
The Electronic Journal of Combinatorics | 2019-05-20 | Paper |
A note on the maximum number of triangles in a <i>C</i><sub>5</sub>‐free graph
Journal of Graph Theory | 2019-03-28 | Paper |
On the rainbow Turán number of paths
The Electronic Journal of Combinatorics | 2019-03-05 | Paper |
On the rainbow Turán number of paths
The Electronic Journal of Combinatorics | 2019-03-05 | Paper |
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
Journal of Combinatorial Theory. Series A | 2019-01-25 | Paper |
Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
Journal of Combinatorial Theory. Series A | 2019-01-25 | Paper |
Rainbow Ramsey problems for the Boolean lattice
(available as arXiv preprint) | 2018-09-23 | Paper |
On the Turán number of some ordered even cycles
European Journal of Combinatorics | 2018-08-24 | Paper |
On the Turán number of some ordered even cycles
European Journal of Combinatorics | 2018-08-24 | Paper |
On the maximum size of connected hypergraphs without a path of given length
Discrete Mathematics | 2018-07-26 | Paper |
On the maximum size of connected hypergraphs without a path of given length
Discrete Mathematics | 2018-07-26 | Paper |
A note on the linear cycle cover conjecture of Gyárfás and Sárközy
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
A note on the linear cycle cover conjecture of Gyárfás and Sárközy
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
3-uniform hypergraphs and linear cycles
SIAM Journal on Discrete Mathematics | 2018-04-27 | Paper |
An upper bound on the size of diamond-free families of sets
Journal of Combinatorial Theory. Series A | 2018-03-02 | Paper |
An upper bound on the size of diamond-free families of sets
Journal of Combinatorial Theory. Series A | 2018-03-02 | Paper |
3-uniform hypergraphs and linear cycles
(available as arXiv preprint) | 2018-01-18 | Paper |
| 3-uniform hypergraphs and linear cycles | 2018-01-18 | Paper |
A note on the maximum number of triangles in a C₅-free graph
(available as arXiv preprint) | 2018-01-18 | Paper |
| On subgraphs of \(C_{2k}\)-free graphs | 2018-01-18 | Paper |
Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
An Erdős-Gallai type theorem for uniform hypergraphs
European Journal of Combinatorics | 2017-12-21 | Paper |
| A simple discharging method for forbidden subposet problems | 2017-10-13 | Paper |
Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Intersecting P-free families
Journal of Combinatorial Theory. Series A | 2017-07-13 | Paper |
An improvement of the general bound on the largest family of subsets avoiding a subposet
Order | 2017-04-20 | Paper |
An improvement of the general bound on the largest family of subsets avoiding a subposet
Order | 2017-04-20 | Paper |
De Bruijn-Erdős-type theorems for graphs and posets
Discrete Mathematics | 2017-02-27 | Paper |
A simple discharging method for forbidden subposet problems
(available as arXiv preprint) | 2017-01-01 | Paper |
Exact forbidden subposet results using chain decompositions of the cycle
The Electronic Journal of Combinatorics | 2016-01-25 | Paper |
Exact forbidden subposet results using chain decompositions of the cycle
The Electronic Journal of Combinatorics | 2016-01-25 | Paper |
