Codegree conditions for cycle decompositions and Euler tours in 3-uniform hypergraphs

被引：0

作者：

Piga, Simon ^{[1
]}

Sanhueza-Matamala, Nicolas ^{[2
]}

机构：

[1] Univ Hamburg, Fachbereich Math, Hamburg, Germany

[2] Czech Acad Sci, Inst Comp Sci, Pod Vodarenskou Vezi 2, Prague 18207, Czech Republic

来源：

PROCEEDINGS OF THE XI LATIN AND AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM | 2021年 / 195卷

关键词：

Hypergraphs; Euler tours; Cycles; Decompositions;

D O I：

10.1016/j.procs.2021.11.043

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We show that 3-graphs whose codegree is at least (2/3 + o(1))n can be decomposed into tight cycles and admit Euler tours, subject to the trivial necessary divisibility conditions. We also provide a construction showing that our bounds are best possible up to the o(1) term. All together, our results answer in the negative some recent questions of Glock, Joos, Kiihn and Osthus. (C) 2021 The Authors. Published by Elsevier B.V.

引用

页码：350 / 358

页数：9

共 34 条

[11] On Generalized Ramsey Numbers for 3-Uniform Hypergraphs
Dudek, Andrzej
Mubayi, Dhruv
JOURNAL OF GRAPH THEORY, 2014, 76 (03) : 217 - 223
[12] Squares of Hamiltonian cycles in 3-uniform hypergraphs
Bedenknecht, Wiebke
Reiher, Christian
RANDOM STRUCTURES & ALGORITHMS, 2020, 56 (02) : 339 - 372
[13] 3-Uniform hypergraphs from vector spaces
Meulewaeter, Jeroen
Van Maldeghem, Hendrik
LINEAR ALGEBRA AND ITS APPLICATIONS, 2024, 690 : 91 - 111
[14] Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs
Buss, Enno
Han, Hiep
Schacht, Mathias
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2013, 103 (06) : 658 - 678
[15] Packing tight Hamilton cycles in 3-uniform hypergraphs
Frieze, Alan
Krivelevich, Michael
Loh, Po-Shen
RANDOM STRUCTURES & ALGORITHMS, 2012, 40 (03) : 269 - 300
[16] Asymptotic Turan number for linear 5-cycle in 3-uniform linear hypergraphs
Gao, Guorong
Chang, An
Sun, Qi
DISCRETE MATHEMATICS, 2023, 346 (01)
[17] The Ramsey number of loose paths in 3-uniform hypergraphs
Maherani, Leila
Omidi, Golam Reza
Raeisi, Ghaffar
Shahsiah, Maryam
ELECTRONIC JOURNAL OF COMBINATORICS, 2013, 20 (01)
[18] Embedding loose spanning trees in 3-uniform hypergraphs
Pehova, Yanitsa
Petrova, Kalina
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2024, 168 : 47 - 67
[19] A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs
Schuelke, Bjarne
COMBINATORICS PROBABILITY AND COMPUTING, 2023, 32 (05) : 762 - 781
[20] Transference for loose Hamilton cycles in random 3-uniform hypergraphs
Petrova, Kalina
Trujic, Milos
RANDOM STRUCTURES & ALGORITHMS, 2024, 65 (02) : 313 - 341

← 1 2 3 4 →