Autor(es)

Han, Jie ^[1] ; Lo, Allan ^[2] ; Treglown, Andrew ^[2] ; Zhao, Yi ^[3]

Afiliação do(s) autor(es)

^[1] Univ Sao Paulo, Inst Matemat & Estat, BR-05508090 Sao Paulo, SP - Brazil

^[2] Univ Birmingham, Sch Math, Birmingham B15 2TT, W Midlands - England

^[3] Georgia State Univ, Dept Math & Stat, Atlanta, GA 30303 - USA

• Tipo de documento: Artigo Científico
• Fonte: COMBINATORICS PROBABILITY & COMPUTING; v. 26, n. 6, p. 856-885, NOV 2017.
• Citações Web of Science: 2

Resumo

Given hypergraphs F and H, an F-factor in H is a set of vertex-disjoint copies of F which cover all the vertices in H. Let K-4(-) denote the 3-uniform hypergraph with four vertices and three edges. We show that for sufficiently large n is an element of 4N, every 3-uniform hypergraph H on n vertices with minimum codegree at least n/2 - 1 contains a K-4(-)-factor. Our bound on the minimum codegree here is best possible. It resolves a conjecture of Lo and Markstrom {[}15] for large hypergraphs, who earlier proved an asymptotically exact version of this result. Our proof makes use of the absorbing method as well as a result of Keevash and Mycroft {[}11] concerning almost perfect matchings in hypergraphs. (AU)

• Processo FAPESP: 14/18641-5 - Circuitos hamiltonianos e problemas de ladrilhamento em hipergrafos
• Beneficiário: Jie Han
• Modalidade de apoio: Bolsas no Brasil - Pós-Doutorado
• Processo FAPESP: 13/03447-6 - Estruturas combinatórias, otimização e algoritmos em Teoria da Computação
• Beneficiário: Carlos Eduardo Ferreira
• Modalidade de apoio: Auxílio à Pesquisa - Temático