HYPERGRAPHS WITH NO TIGHT CYCLES

被引:7
|
作者
Letzter, Shoham [1 ]
机构
[1] UCL, Dept Math, Gower St, London WC1E 6BT, England
关键词
D O I
10.1090/proc/16043
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We show that every r-uniform hypergraph on n vertices which does not contain a tight cycle has at most O(nr-1(log n)5) edges. This is an improvement on the previously best-known bound, of nr-1eO(root log n), due to Sudakov and Tomon, and our proof builds on their work. A recent construction of B. Janzer implies that our bound is tight up to an O((log n)4 log log n) factor.
引用
下载
收藏
页码:455 / 462
页数:8
相关论文
共 50 条
  • [31] On the notion of cycles in hypergraphs
    Jegou, Philippe
    Ndiaye, Samba Ndojh
    DISCRETE MATHEMATICS, 2009, 309 (23-24) : 6535 - 6543
  • [32] Homology Cycles and Dependent Cycles of Hypergraphs
    Wang, Jian-fang
    Xu, Xin
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2018, 34 (02): : 237 - 248
  • [33] Even cycles in hypergraphs
    Kostochka, A
    Verstraëte, J
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2005, 94 (01) : 173 - 182
  • [34] HYPERGRAPHS WITH NO SPECIAL CYCLES
    ANSTEE, RP
    COMBINATORICA, 1983, 3 (02) : 141 - 146
  • [35] ON THE MINIMUM SIZE OF TIGHT HYPERGRAPHS
    AROCHA, JL
    BRACHO, J
    NEUMANNLARA, V
    JOURNAL OF GRAPH THEORY, 1992, 16 (04) : 319 - 326
  • [36] Loose Hamilton cycles in hypergraphs
    Keevash, Peter
    Kuehn, Daniela
    Mycroft, Richard
    Osthus, Deryk
    DISCRETE MATHEMATICS, 2011, 311 (07) : 544 - 559
  • [37] On extremal hypergraphs for Hamiltonian cycles
    Glebov, Roman
    Person, Yury
    Weps, Wilma
    EUROPEAN JOURNAL OF COMBINATORICS, 2012, 33 (04) : 544 - 555
  • [38] Hamilton cycles in quasirandom hypergraphs
    Lenz, John
    Mubayi, Dhruv
    Mycroft, Richard
    RANDOM STRUCTURES & ALGORITHMS, 2016, 49 (02) : 363 - 378
  • [39] Cycles of given lengths in hypergraphs
    Jiang, Tao
    Ma, Jie
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2018, 133 : 54 - 77
  • [40] On hypergraphs without loose cycles
    Han, Jie
    Kohayakawa, Yoshiharu
    DISCRETE MATHEMATICS, 2018, 341 (04) : 946 - 949