Advanced search
Start date
Betweenand

Perfect matchings and Tilings in hypergraphs

Grant number: 15/07869-8
Support type:Scholarships abroad - Research Internship - Post-doctor
Effective date (Start): September 14, 2015
Effective date (End): September 13, 2016
Field of knowledge:Physical Sciences and Mathematics - Computer Science - Computational Mathematics
Principal Investigator:Yoshiharu Kohayakawa
Grantee:Jie Han
Supervisor abroad: Deryk Osthus
Home Institution: Instituto de Matemática e Estatística (IME). Universidade de São Paulo (USP). São Paulo , SP, Brazil
Local de pesquisa : University of Birmingham, England  
Associated to the scholarship:14/18641-5 - Hamilton cycles and tiling problems in hypergraphs, BP.PD

Abstract

This is the research project for Jie Han's research visit to the University of Birmingham. This researcher will be a visiting postdoctoral research fellow at the School of Mathematics of the University of Birmingham. We propose to attack both structural and computational problems on perfect matchings and tilings in hypergraphs. This line of research has drawn a great deal of attention from the field in the last decade. (AU)

Scientific publications (12)
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
HAN, JIE; TREGLOWN, ANDREW. The complexity of perfect matchings and packings in dense hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 141, p. 72-104, MAR 2020. Web of Science Citations: 0.
GAO, WEI; HAN, JIE; ZHAO, YI. Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles. COMBINATORICS PROBABILITY & COMPUTING, v. 28, n. 6, p. 840-870, NOV 2019. Web of Science Citations: 1.
HAN, JIE; ZANG, CHUANYUN; ZHAO, YI. Matchings in k-partite k-uniform hypergraphs. JOURNAL OF GRAPH THEORY, NOV 2019. Web of Science Citations: 0.
HAN, JIE; KIM, JAEHOON. Two-regular subgraphs of odd-uniform hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES B, v. 128, p. 175-191, JAN 2018. Web of Science Citations: 0.
CHEN, GUANTAO; HAN, JIE; SUIL, O.; SHAN, SONGLING; TSUCHIYA, SHOICHI. Forbidden Pairs and the Existence of a Spanning Halin Subgraph. GRAPHS AND COMBINATORICS, v. 33, n. 5, p. 1321-1345, SEP 2017. Web of Science Citations: 1.
GAO, WEI; HAN, JIE. Minimum Codegree Threshold for C-6(3)-Factors in 3-Uniform Hypergraphs. COMBINATORICS PROBABILITY & COMPUTING, v. 26, n. 4, p. 536-559, JUL 2017. Web of Science Citations: 3.
HAN, JIE. DECISION PROBLEM FOR PERFECT MATCHINGS IN DENSE k-UNIFORM HYPERGRAPHS. Transactions of the American Mathematical Society, v. 369, n. 7, p. 5197-5218, JUL 2017. Web of Science Citations: 6.
HAN, JIE; ZANG, CHUANYUN; ZHAO, YI. Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs. JOURNAL OF COMBINATORIAL THEORY SERIES A, v. 149, p. 115-147, JUL 2017. Web of Science Citations: 4.
HAN, JIE; KOHAYAKAWA, YOSHIHARU. 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, v. 145, n. 1, p. 73-87, JAN 2017. Web of Science Citations: 4.
HAN, JIE; ZHAO, YI. Forbidding Hamilton cycles in uniform hypergraphs. JOURNAL OF COMBINATORIAL THEORY SERIES A, v. 143, p. 107-115, OCT 2016. Web of Science Citations: 0.
HAN, JIE. PERFECT MATCHINGS IN HYPERGRAPHS AND THE ERDOS MATCHING CONJECTURE. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 30, n. 3, p. 1351-1357, 2016. Web of Science Citations: 7.
HAN, JIE. NEAR PERFECT MATCHINGS IN k-UNIFORM HYPERGRAPHS II. SIAM JOURNAL ON DISCRETE MATHEMATICS, v. 30, n. 3, p. 1453-1469, 2016. Web of Science Citations: 1.

Please report errors in scientific publications list by writing to: cdi@fapesp.br.