| Publication | Date of Publication | Type |
|---|
Transversal Hamilton cycle in hypergraph systems
SIAM Journal on Discrete Mathematics | 2025-01-22 | Paper |
Spanning trees in graphs without large bipartite holes
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
On powers of Hamilton cycles in Ramsey-Turán theory
SIAM Journal on Discrete Mathematics | 2024-10-22 | Paper |
On some extremal results for order types
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
\(H\)-factors in graphs with small independence number
Journal of Combinatorial Theory. Series B | 2024-10-08 | Paper |
Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs
European Journal of Combinatorics | 2024-07-08 | Paper |
The decision problem for perfect matchings in dense hypergraphs
| 2024-06-24 | Paper |
scientific article; zbMATH DE number 7788344 (Why is no real title available?)
| 2024-01-15 | Paper |
A Ramsey–Turán theory for tilings in graphs
Random Structures & Algorithms | 2024-01-05 | Paper |
Clique-factors in graphs with sublinear -independence number
Combinatorics, Probability and Computing | 2023-11-08 | Paper |
A robust version of the multipartite Hajnal--Szemer\'edi theorem
| 2023-11-01 | Paper |
The threshold for powers of tight Hamilton cycles in random hypergraphs
| 2023-10-29 | Paper |
On powers of tight Hamilton cycles in randomly perturbed hypergraphs
Random Structures & Algorithms | 2023-10-17 | Paper |
Factors in randomly perturbed hypergraphs
Random Structures & Algorithms | 2023-10-12 | Paper |
Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
Random Structures & Algorithms | 2023-10-12 | Paper |
Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu
Random Structures & Algorithms | 2023-10-11 | Paper |
Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs
Journal of Graph Theory | 2023-10-05 | Paper |
Finding any given 2‐factor in sparse pseudorandom graphs efficiently
Journal of Graph Theory | 2023-09-29 | Paper |
F$F$‐factors in Quasi‐random Hypergraphs
Journal of the London Mathematical Society | 2023-08-22 | Paper |
An algorithmic version of the Hajnal--Szemer\'edi theorem
| 2023-07-16 | Paper |
On powers of Hamilton cycles in Ramsey-Tur\'{a}n Theory
| 2023-05-27 | Paper |
Zero-nonzero tree patterns that allow Sn∗
Linear and Multilinear Algebra | 2023-05-03 | Paper |
Embedding clique-factors in graphs with low \(\ell\)-independence number
Journal of Combinatorial Theory. Series B | 2023-05-02 | Paper |
Near-perfect clique-factors in sparse pseudorandom graphs
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
Tiling multipartite hypergraphs in quasi-random hypergraphs
Journal of Combinatorial Theory. Series B | 2023-03-23 | Paper |
Spanning trees in graphs without large bipartite holes
| 2023-02-08 | Paper |
Spanning trees in sparse expanders
| 2022-11-09 | Paper |
Finding matchings in dense hypergraphs
| 2022-10-23 | Paper |
Matching of given sizes in hypergraphs
SIAM Journal on Discrete Mathematics | 2022-10-06 | Paper |
$H$-factors in graphs with small independence number
| 2022-07-06 | Paper |
Turán number of disjoint triangles in 4-partite graphs
The Electronic Journal of Combinatorics | 2022-06-13 | Paper |
Hamiltonicity in cherry-quasirandom 3-graphs
European Journal of Combinatorics | 2022-04-07 | Paper |
Matchings in \(k\)-partite \(k\)-uniform hypergraphs
Journal of Graph Theory | 2022-03-31 | Paper |
On the Keevash-Knox-Mycroft Conjecture
| 2022-02-08 | Paper |
Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs
Journal of Combinatorial Theory. Series B | 2022-01-26 | Paper |
Tiling multipartite hypergraphs in Quasi-random Hypergraphs
| 2021-11-28 | Paper |
Transversal Hamilton cycle in hypergraph systems
| 2021-11-13 | Paper |
The size-Ramsey number of 3-uniform tight paths
Advances in Combinatorics | 2021-11-05 | Paper |
On perfect matchings in \(k\)-complexes
IMRN. International Mathematics Research Notices | 2021-09-21 | Paper |
Covering and tiling hypergraphs with tight cycles
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Finding Perfect Matchings in Dense Hypergraphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
The multicolour size-Ramsey number of powers of paths
Journal of Combinatorial Theory. Series B | 2020-09-24 | Paper |
The number of Gallai \(k\)-colorings of complete graphs
Journal of Combinatorial Theory. Series B | 2020-07-07 | Paper |
Hamiltonicity in randomly perturbed hypergraphs
Journal of Combinatorial Theory. Series B | 2020-07-07 | Paper |
Codegree conditions for tiling complete \(k\)-partite \(k\)-graphs and loose cycles
Combinatorics, Probability and Computing | 2020-04-06 | Paper |
Universality for bounded degree spanning trees in randomly perturbed graphs
Random Structures & Algorithms | 2020-02-14 | Paper |
Powers of tight Hamilton cycles in randomly perturbed hypergraphs
Random Structures & Algorithms | 2020-02-14 | Paper |
Property testing for point sets on the plane
| 2020-02-12 | Paper |
The complexity of perfect matchings and packings in dense hypergraphs
Journal of Combinatorial Theory. Series B | 2020-01-15 | Paper |
Extremal and probabilistic results for order types
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Clique-factors in sparse pseudorandom graphs
European Journal of Combinatorics | 2019-08-30 | Paper |
Finding any given 2-factor in sparse pseudorandom graphs efficiently
| 2019-02-16 | Paper |
Near-perfect clique-factors in sparse pseudorandom graphs
| 2018-10-11 | Paper |
On vertex-disjoint paths in regular graphs
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
On perfect matchings and tilings in uniform hypergraphs
SIAM Journal on Discrete Mathematics | 2018-04-27 | Paper |
On hypergraphs without loose cycles
Discrete Mathematics | 2018-02-23 | Paper |
Covering and tiling hypergraphs with tight cycles
| 2018-01-18 | Paper |
A degree version of the Hilton-Milner theorem
Journal of Combinatorial Theory. Series A | 2018-01-12 | Paper |
Forbidden pairs and the existence of a spanning Halin subgraph
Graphs and Combinatorics | 2017-12-12 | Paper |
Two-regular subgraphs of odd-uniform hypergraphs
Journal of Combinatorial Theory. Series B | 2017-11-28 | Paper |
Exact minimum codegree threshold for \(K^-_4\)-factors
Combinatorics, Probability and Computing | 2017-10-27 | Paper |
Minimum codegree threshold for \(C_6^3\)-factors in 3-uniform hypergraphs
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Near perfect matchings in \(k\)-uniform hypergraphs
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
The complexity of perfect packings in dense graphs
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Decision problem for perfect matchings in dense \(k\)-uniform hypergraphs
Transactions of the American Mathematical Society | 2017-04-12 | Paper |
Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
Journal of Combinatorial Theory. Series A | 2017-03-20 | Paper |
The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton-Milner family
Proceedings of the American Mathematical Society | 2016-11-14 | Paper |
Near Perfect Matchings in ${k}$-Uniform Hypergraphs II
SIAM Journal on Discrete Mathematics | 2016-08-04 | Paper |
Forbidding Hamilton cycles in uniform hypergraphs
Journal of Combinatorial Theory. Series A | 2016-08-01 | Paper |
Perfect matchings in hypergraphs and the Erdős matching conjecture
SIAM Journal on Discrete Mathematics | 2016-07-13 | Paper |
Minimum vertex degree threshold for \(\mathcal{C}_4^3\)-tiling
Journal of Graph Theory | 2015-07-23 | Paper |
Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
Journal of Combinatorial Theory. Series B | 2015-06-22 | Paper |
Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs
Journal of Combinatorial Theory. Series A | 2015-02-27 | Paper |
On multipartite Hajnal-Szemerédi theorems
Discrete Mathematics | 2013-04-17 | Paper |
Large $ Y_{3,2} $-tilings in 3-uniform hypergraphs
| N/A | Paper |
Hamiltonicity of Sparse Pseudorandom Graphs
| N/A | Paper |
