Degree Conditions for Tight Hamilton Cycles

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F21%3A00581999" target="_blank" >RIV/67985807:_____/21:00581999 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/978-3-030-83823-2_87" target="_blank" >https://doi.org/10.1007/978-3-030-83823-2_87</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-83823-2_87" target="_blank" >10.1007/978-3-030-83823-2_87</a>

Result language
angličtina
Original language name
Degree Conditions for Tight Hamilton Cycles
Original language description
We develop a framework to study minimum d-degree conditions in k-uniform hypergraphs, which guarantee the existence of a tight Hamilton cycle. Our main theoretical result deals with the typical absorption, path-cover and connecting arguments for all k and d at once, and thus sheds light on the underlying structural problems. Building on this, we show that one can study minimum d-degree conditions of k-uniform tight Hamilton cycles by focusing on the inner structure of the neighbourhoods. This reduces the matter to an Erdős–Gallai-type question for (k-d)-uniform hypergraphs.
Czech name
—
Czech description
—

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

Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)