Jie Han

Jie Hu

CoRR, 2023

2022

Matching of Given Sizes in Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2022

Factors and loose Hamilton cycles in sparse pseudo-random hypergraphs.

[BibT_eX]

[DOI]

Hiêp Hàn

Patrick Morris

Random Struct. Algorithms, 2022

Factors in randomly perturbed hypergraphs.

[BibT_eX]

[DOI]

Guilherme Oliveira Mota

Random Struct. Algorithms, 2022

Covering 3-uniform hypergraphs by vertex-disjoint tight paths.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

Minimum degree thresholds for Hamilton (k/2)-cycles in k-uniform hypergraphs.

[BibT_eX]

[DOI]

Hiêp Hàn

J. Comb. Theory B, 2022

Structural Entropy of the Stochastic Block Models.

[BibT_eX]

[DOI]

Entropy, 2022

Hamiltonicity in Cherry-quasirandom 3-graphs.

[BibT_eX]

[DOI]

Luyining Gan

Eur. J. Comb., 2022

Semantic Compression with Side Information: A Rate-Distortion Perspective.

[BibT_eX]

[DOI]

CoRR, 2022

Turán Number of Disjoint Triangles in 4-Partite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Protecting Semantic Information Using An Efficient Secret Key.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

The Decision Problem for Perfect Matchings in Dense Hypergraphs.

[BibT_eX]

[DOI]

Luyining Gan

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Tilings in randomly perturbed graphs: Bridging the gap between Hajnal-Szemerédi and Johansson-Kahn-Vu.

[BibT_eX]

[DOI]

Patrick Morris

Andrew Treglown

Random Struct. Algorithms, 2021

Finding any given 2-factor in sparse pseudorandom graphs efficiently.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Non-linear Hamilton cycles in linear quasi-random hypergraphs.

[BibT_eX]

[DOI]

Xichao Shu

Guanghui Wang

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

The K-Core Decomposition Algorithm Under the Framework of GraphBLAS.

[BibT_eX]

[DOI]

Proceedings of the 2021 IEEE High Performance Extreme Computing Conference, 2021

2020

Matchings in k-partite k-uniform hypergraphs.

[BibT_eX]

[DOI]

Chuanyun Zang

J. Graph Theory, 2020

Hamiltonicity in randomly perturbed hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

The multicolour size-Ramsey number of powers of paths.

[BibT_eX]

[DOI]

Matthew Jenssen

Josefran de Oliveira Bastos

Guilherme Oliveira Mota

Barnaby Roberts

J. Comb. Theory B, 2020

The number of Gallai k-colorings of complete graphs.

[BibT_eX]

[DOI]

Fabrício Siqueira Benevides

J. Comb. Theory B, 2020

The complexity of perfect matchings and packings in dense hypergraphs.

[BibT_eX]

[DOI]

Andrew Treglown

J. Comb. Theory B, 2020

2019

Universality for bounded degree spanning trees in randomly perturbed graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2019

Powers of tight Hamilton cycles in randomly perturbed hypergraphs.

[BibT_eX]

[DOI]

Wiebke Bedenknecht

Guilherme Oliveira Mota

Random Struct. Algorithms, 2019

Clique-factors in sparse pseudorandom graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles.

[BibT_eX]

[DOI]

Wei Gao

Comb. Probab. Comput., 2019

Extremal and probabilistic results for order types.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

A degree version of the Hilton-Milner theorem.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2018

Near-perfect clique-factors in sparse pseudorandom graphs.

[BibT_eX]

[DOI]

Yury Person

Electron. Notes Discret. Math., 2018

On hypergraphs without loose cycles.

[BibT_eX]

[DOI]

Discret. Math., 2018

Property Testing for Point Sets on the Plane.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs.

[BibT_eX]

[DOI]

Chuanyun Zang

J. Comb. Theory A, 2017

Forbidden Pairs and the Existence of a Spanning Halin Subgraph.

[BibT_eX]

[DOI]

Graphs Comb., 2017

Covering and tiling hypergraphs with tight cycles.

[BibT_eX]

[DOI]

Nicolás Sanhueza-Matamala

Allan Lo

Electron. Notes Discret. Math., 2017

Exact Minimum Codegree Threshold for K - 4-Factors.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2017

Minimum Codegree Threshold for C 6 3-Factors in 3-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Wei Gao

Comb. Probab. Comput., 2017

The Complexity of Perfect Packings in Dense Graphs.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2017

2016

Near Perfect Matchings in k-Uniform Hypergraphs II.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Forbidding Hamilton cycles in uniform hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2016

2015

Minimum vertex degree threshold for C43-tiling.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Minimum codegree threshold for Hamilton ℓ-cycles in k-uniform hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2015

Near Perfect Matchings in k-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2015

2013

On multipartite Hajnal-Szemerédi theorems.

[BibT_eX]

[DOI]