Cycle Decompositions in 3-Uniform Hypergraphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F23%3A00573795" target="_blank" >RIV/67985807:_____/23:00573795 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/s00493-023-00001-2" target="_blank" >https://doi.org/10.1007/s00493-023-00001-2</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00493-023-00001-2" target="_blank" >10.1007/s00493-023-00001-2</a>
Alternative languages
Result language
angličtina
Original language name
Cycle Decompositions in 3-Uniform Hypergraphs
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/GA19-08740S" target="_blank" >GA19-08740S: Embedding, Packing and Limits in Graphs</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Combinatorica
ISSN
0209-9683
e-ISSN
1439-6912
Volume of the periodical
43
Issue of the periodical within the volume
1
Country of publishing house
DE - GERMANY
Number of pages
36
Pages from-to
1-36
UT code for WoS article
000988892300001
EID of the result in the Scopus database
2-s2.0-85159296378