[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.
机构:
Hungarian Acad Sci, Alfred Renyi Inst Math, POB 127, H-1364 Budapest, HungaryHungarian Acad Sci, Alfred Renyi Inst Math, POB 127, H-1364 Budapest, Hungary
Furedi, Zoltan
Ozkahya, Lale
论文数: 0引用数: 0
h-index: 0
机构:
Hacettepe Univ, Dept Comp Engn, Ankara, TurkeyHungarian Acad Sci, Alfred Renyi Inst Math, POB 127, H-1364 Budapest, Hungary
机构:
Cent European Univ, Dept Math, Budapest, HungaryCent European Univ, Dept Math, Budapest, Hungary
Ergemlidze, Beka
Gyori, Ervin
论文数: 0引用数: 0
h-index: 0
机构:
Cent European Univ, Dept Math, Budapest, Hungary
Cent European Univ, Hungarian Acad Sci, Renyi Inst, Budapest, HungaryCent European Univ, Dept Math, Budapest, Hungary
Gyori, Ervin
Methuku, Abhishek
论文数: 0引用数: 0
h-index: 0
机构:
Cent European Univ, Dept Math, Budapest, HungaryCent European Univ, Dept Math, Budapest, Hungary