Počet záznamů: 1
Cycle Decompositions in 3-Uniform Hypergraphs
- 1.0573795 - ÚI 2024 RIV DE eng J - Článek v odborném periodiku
Piga, S. - Sanhueza-Matamala, Nicolás
Cycle Decompositions in 3-Uniform Hypergraphs.
Combinatorica. Roč. 43, č. 1 (2023), s. 1-36. ISSN 0209-9683. E-ISSN 1439-6912
Grant CEP: GA ČR(CZ) GA19-08740S
Institucionální podpora: RVO:67985807
Klíčová slova: Hypergraphs * Euler tours * Cycles * Graph decompositions
Obor OECD: Pure mathematics
Impakt faktor: 1.1, rok: 2022
Způsob publikování: Omezený přístup
https://doi.org/10.1007/s00493-023-00001-2
We show that 3-graphs on n vertices whose minimum 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 a o(1) term. All together, our results answer in the negative some recent questions of Glock, Joos, Kühn, and Osthus.
Trvalý link: https://hdl.handle.net/11104/0344150
Počet záznamů: 1