| Publication | Date of Publication | Type |
|---|
Large $ Y_{3,2} $-tilings in 3-uniform hypergraphs
(available as arXiv preprint) | N/A | Paper |
Hamiltonicity of Sparse Pseudorandom Graphs
(available as arXiv preprint) | N/A | Paper |
Distributed deferred prescribed performance and dynamic event-triggered formation tracking for one-sided Lipschitz multi-agent systems
Communications in Nonlinear Science and Numerical Simulation | 2026-09-03 | Paper |
Supersaturation of odd linear cycles
The Electronic Journal of Combinatorics | 2026-08-03 | Paper |
Erratum to: ``Rainbow spanning structures in graph and hypergraph systems''
Forum of Mathematics, Sigma | 2026-07-27 | Paper |
Powers of Hamilton cycles in oriented and directed graphs
Combinatorics, Probability and Computing | 2026-07-24 | Paper |
Finding matchings in dense hypergraphs
ACM Transactions on Algorithms | 2026-07-17 | Paper |
Non-linear Hamilton cycles in linear quasirandom and uniformly dense hypergraphs
Journal of Combinatorial Theory. Series B | 2026-01-15 | Paper |
A parameterized algorithm for K_r-factors in graphs of high minimum degree
(available as arXiv preprint) | 2026-01-01 | Paper |
Exact minimum co-degree conditions for \ell-Hamiltonicity in hypergraphs
(available as arXiv preprint) | 2026-01-01 | Paper |
The perturbation threshold of degenerate graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
Note on the codegree version of the Erdős--Ko--Rado theorem
(available as arXiv preprint) | 2026-01-01 | Paper |
Decision problem for Hamilton 2-cycles in 4-graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
Exact Minimum d-Degree Thresholds for Hypergraph Perfect Matchings
(available as arXiv preprint) | 2026-01-01 | Paper |
On P₄-intersecting families of graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
Optimally pseudorandom K₄-free graphs
(available as arXiv preprint) | 2026-01-01 | Paper |
Perfect Matching in k-Partite k-Uniform Hypergraphs
(available as arXiv preprint) | 2026-01-01 | Paper |
A parameterized algorithm for K_r-factors in graphs of high minimum degree
SIAM Journal on Discrete Mathematics | 2026-01-01 | Paper |
Clique-factors in randomly perturbed hypergraphs
(available as arXiv preprint) | 2026-01-01 | Paper |
Hamiltonicity of sparse pseudorandom graphs
Combinatorics, Probability and Computing | 2025-12-30 | Paper |
New similarity reductions and exact solutions of the (2+1)-dimensional extended Bogoyavlenskii-Kadomtsev-Petviashvili equation
Theoretical and Mathematical Physics | 2025-12-15 | Paper |
On the Keevash-Knox-Mycroft conjecture
Journal of Combinatorial Theory. Series B | 2025-07-29 | Paper |
New second order approximation method for posterior precision evaluation of weighted total least squares estimates with analytical expression
Communications in Statistics. Simulation and Computation | 2025-06-13 | Paper |
The threshold for powers of tight Hamilton cycles in random hypergraphs
Discrete Mathematics | 2025-06-12 | Paper |
A Wong-Zakai approximation for effective filtering of a class of stochastic evolutionary equation
Acta Mathematicae Applicatae Sinica | 2025-03-31 | Paper |
Minimum degree conditions for Hamilton l-cycles in k-uniform hypergraphs
The Electronic Journal of Combinatorics | 2025-03-06 | Paper |
Convolution type of metaplectic Cohen's distribution time-frequency analysis theory, method and technology
IEEE Transactions on Information Theory | 2025-02-27 | Paper |
On rainbow thresholds
Random Structures & Algorithms | 2025-02-14 | Paper |
Transversal Hamilton cycle in hypergraph systems
SIAM Journal on Discrete Mathematics | 2025-01-22 | Paper |
Supersaturation of odd linear cycles
(available as arXiv preprint) | 2025-01-01 | Paper |
Perfect Matchings in Random Sparsifications of Dense Hypergraphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Transversal packings in families of percolated hypergraphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Perturbation of dense graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Clique-factors in graphs with low $K_{\ell}$-independence number
(available as arXiv preprint) | 2025-01-01 | Paper |
Robustness for expander graphs
(available as arXiv preprint) | 2025-01-01 | 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 |
Ramsey--Dirac theory for bounded degree hypertrees
(available as arXiv preprint) | 2024-01-01 | Paper |
Powers of Hamilton cycles in oriented and directed graphs
(available as arXiv preprint) | 2024-01-01 | 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 |
FF‐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 -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 |
A robust version of the multipartite Hajnal--Szemerédi theorem
(available as arXiv preprint) | 2023-01-01 | 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 |
Finding matchings in dense hypergraphs
(available as arXiv preprint) | 2022-01-01 | Paper |
Dirac-type Problem of Rainbow matchings and Hamilton cycles in Random Graphs
(available as arXiv preprint) | 2022-01-01 | Paper |
Spanning trees in sparse expanders
(available as arXiv preprint) | 2022-01-01 | Paper |
Tiling multipartite hypergraphs in Quasi-random Hypergraphs
(available as arXiv preprint) | 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 |
Powers of tight Hamilton cycles in randomly perturbed hypergraphs
Random Structures & Algorithms | 2020-02-14 | Paper |
Universality for bounded degree spanning trees in randomly perturbed graphs
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
(available as arXiv preprint) | 2018-10-11 | Paper |
On vertex-disjoint paths in regular graphs
The Electronic Journal of Combinatorics | 2018-05-25 | 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
(available as arXiv preprint) | 2018-01-18 | 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 |
Hamiltonicity in randomly perturbed hypergraphs
(available as arXiv preprint) | 2018-01-01 | Paper |
