Tight Hamilton cycles in random uniform hypergraphs

被引：26

作者：

Dudek, Andrzej ^{[1
]}

Frieze, Alan ^{[2
]}

机构：

[1] Western Michigan Univ, Dept Math, Kalamazoo, MI 49008 USA

[2] Carnegie Mellon Univ, Dept Math Sci, Pittsburgh, PA 15213 USA

来源：

RANDOM STRUCTURES & ALGORITHMS | 2013年 / 42卷 / 03期

基金：

美国国家科学基金会;

关键词：

Hamiltonicity; random hypergraphs; RANDOM GRAPHS;

D O I：

10.1002/rsa.20404

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

In this paper we show that e/n is the sharp threshold for the existence of tight Hamilton cycles in random k -uniform hypergraphs, for all k 4. When k = 3 we show that 1/n is an asymptotic threshold. We also determine thresholds for the existence of other types of Hamilton cycles. (c) 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013

引用

页码：374 / 385

页数：12

共 50 条

[1] Tight Hamilton Cycles in Random Hypergraphs
Allen, Peter
Boettcher, Julia
Kohayakawa, Yoshiharu
Person, Yury
[J]. RANDOM STRUCTURES & ALGORITHMS, 2015, 46 (03) : 446 - 465
[2] PACKING TIGHT HAMILTON CYCLES IN UNIFORM HYPERGRAPHS
Bal, Deepak
Frieze, Alan
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (02) : 435 - 451
[3] Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs
Nenadov, Rajko
Skoric, Nemanja
[J]. RANDOM STRUCTURES & ALGORITHMS, 2019, 54 (01) : 187 - 208
[4] Loose Hamilton Cycles in Random Uniform Hypergraphs
Dudek, Andrzej
Frieze, Alan
[J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2011, 18 (01):
[5] Finding tight Hamilton cycles in random hypergraphs faster
Allen, Peter
Koch, Christoph
Parczyk, Olaf
Person, Yury
[J]. COMBINATORICS PROBABILITY & COMPUTING, 2021, 30 (02): : 239 - 257
[6] Finding Tight Hamilton Cycles in Random Hypergraphs Faster
Allen, Peter
Koch, Christoph
Parczyk, Olaf
Person, Yury
[J]. LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 28 - 36
[7] Packing tight Hamilton cycles in 3-uniform hypergraphs
Frieze, Alan
Krivelevich, Michael
Loh, Po-Shen
[J]. PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 913 - 932
[8] Packing tight Hamilton cycles in 3-uniform hypergraphs
Frieze, Alan
Krivelevich, Michael
Loh, Po-Shen
[J]. RANDOM STRUCTURES & ALGORITHMS, 2012, 40 (03) : 269 - 300
[9] Loose Hamilton Cycles in Random 3-Uniform Hypergraphs
Frieze, Alan
[J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):
[10] An approximate ore-type result for tight Hamilton cycles in uniform hypergraphs
Tang, Yucong
Yan, Guiying
[J]. DISCRETE MATHEMATICS, 2017, 340 (07) : 1528 - 1534

← 1 2 3 4 5 →