Powers of Hamiltonian cycles in multipartite graphs

@article{DeBiasio2022PowersOH,
title={Powers of Hamiltonian cycles in multipartite graphs},
author={Louis DeBiasio and Ryan R. Martin and Theodore Molla},
journal={Discret. Math.},
year={2022},
volume={345},
pages={112747}
}

It is proved that to everyl andr there is anε(l, r) so that forn>n0 everyr-graph ofn vertices andnr−ε( l, r), which means that all ther-tuples occur in ther-graph.Expand

Introduction. We start out from the following consequence of S. Bernstein's well known theorem on trigonometric polynomials. Let pn(z) be a polynomial of degree n for which | ^(^) | ^ 1 holds as \z\… Expand

Paul Seymour conjectured that any graphG of ordern and minimum degree of at leastk/k+1n contains thekth power of a Hamiltonian cycle. Here, we prove this conjecture for sufficiently largen.

We give an optimal degree condition for a tripartite graph to have a spanning subgraph consisting of complete graphs of order 3. This result is used to give an upper bound of 2 Delta for the strong… Expand

We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect matchings are geometric, and are of two… Expand

It is shown that, for any γ > 0, if every vertex x ∈ Vi is joined to at least $\bigl ((t-1)/t + \gamma \bigr )n$ vertices of Vj for each j ≠ i, then G contains a perfect Kt-matching, provided n is large enough.Expand