Advanced search
Start date
Betweenand
Related content
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

On hypergraphs without loose cycles

Full text
Author(s):
Han, Jie [1] ; Kohayakawa, Yoshiharu [1]
Total Authors: 2
Affiliation:
[1] Univ Sao Paulo, Inst Matemat & Estat, Sao Paulo - Brazil
Total Affiliations: 1
Document type: Journal article
Source: DISCRETE MATHEMATICS; v. 341, n. 4, p. 946-949, APR 2018.
Web of Science Citations: 2
Abstract

Recently, Mubayi and Wang showed that for r >= 4 and l >= 3, the number of n-vertex r-graphs that do not contain any loose cycle of length l is at most 2(0(nr-1(log) (n)(r-3)/(r-2))). We improve this bound to 2(0(nr-1 log log) (n)). (C) 2017 Elsevier B.V. All rights reserved. (AU)

FAPESP's process: 14/18641-5 - Hamilton cycles and tiling problems in hypergraphs
Grantee:Jie Han
Support Opportunities: Scholarships in Brazil - Post-Doctoral
FAPESP's process: 13/07699-0 - Research, Innovation and Dissemination Center for Neuromathematics - NeuroMat
Grantee:Oswaldo Baffa Filho
Support Opportunities: Research Grants - Research, Innovation and Dissemination Centers - RIDC
FAPESP's process: 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science
Grantee:Carlos Eduardo Ferreira
Support Opportunities: Research Projects - Thematic Grants