Results 21 to 30 of about 3,218,251 (319)
Minimum degree conditions for tight Hamilton cycles [PDF]
Journal of the London Mathematical Society, 2020 We develop a new framework to study minimum d$d$ ‐degree conditions in k$k$ ‐uniform hypergraphs, which guarantee the existence of a tight Hamilton cycle.
R. Lang, Nicolás Sanhueza-Matamala
semanticscholar +1 more source
Edge Disjoint Hamilton Cycles in Knödel Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The vertices of the Knödel graph $W_{\Delta, n}$ on $n \geq 2$ vertices, $n$ even, and of maximum degree $\Delta, 1 \leq \Delta \leq \lfloor log_2(n) \rfloor$, are the pairs $(i,j)$ with $i=1,2$ and $0 \leq j \leq \frac{n}{2} -1$.
Palanivel Subramania Nadar Paulraja +1 more
doaj +1 more source
Finding Hamilton cycles in random intersection graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 The construction of the random intersection graph model is based on a random family of sets. Such structures, which are derived from intersections of sets, appear in a natural manner in many applications. In this article we study the problem of finding a
Katarzyna Rybarczyk
doaj +1 more source
A Note on Color-Bias Hamilton Cycles in Dense Graphs
SIAM Journal on Discrete Mathematics, 2021 Balogh, Csaba, Jing, and Pluhar [Electron. J. Combin., 27 (2020)] recently determined the minimum degree threshold that ensures a 2-colored graph $G$ contains a Hamilton cycle of significant color ...
Andrea Freschi +3 more
semanticscholar +1 more source
Packing Hamilton Cycles Online [PDF]
Combinatorics, Probability and Computing, 2018 It is known that w.h.p. the hitting time τ2σ for the random graph process to have minimum degree 2σ coincides with the hitting time for σ edge-disjoint Hamilton cycles [4, 9, 13]. In this paper we prove an online version of this property. We show that, for a fixed integer σ ⩾ 2, if random edges of Kn are presented one by one then w.h.p.
Briggs, Joseph +4 more
openaire +4 more sources
Have Business Cycles Become More Synchronous After NAFTA?
American Business Review, 2021 Trade agreements do not necessitate business cycle comovement. Focusing on NAFTA, we investigate whether business cycles in Canada, Mexico, and the US have become more synchronous after the landmark trade agreement came into effect in 1994.
Puneet Vatsa
doaj +1 more source
Packing Loose Hamilton Cycles [PDF]
Combinatorics, Probability and Computing, 2017 A subsetCof edges in ak-uniform hypergraphHis aloose Hamilton cycleifCcovers all the vertices ofHand there exists a cyclic ordering of these vertices such that the edges inCare segments of that order and such that every two consecutive edges share exactly one vertex.
Ferber, Asaf +3 more
openaire +2 more sources
Extending Cycles Locally to Hamilton Cycles [PDF]
The Electronic Journal of Combinatorics, 2016 A Hamilton circle in an infinite graph is a homeomorphic copy of the unit circle $S^1$ that contains all vertices and all ends precisely once. We prove that every connected, locally connected, locally finite, claw-free graph has such a Hamilton circle, extending a result of Oberly and Sumner to infinite graphs.
Hamann, Matthias +2 more
openaire +2 more sources
Identifying Hamilton cycles in the Cartesian product of directed cycles
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a Cartesian product of directed cycles. It is known that has a Hamilton cycle if there is a permutation of that satisfies and for some positive integers , where . In addition, if then has two arc-disjoint Hamilton cycles.
Zbigniew R. Bogdanowicz
doaj +1 more source
On powers of tight Hamilton cycles in randomly perturbed hypergraphs [PDF]
Random Struct. Algorithms, 2020 For integers k≥3$$ k\ge 3 $$ and r≥2$$ r\ge 2 $$ , we show that for every α>0$$ \alpha >0 $$ , there exists ε>0$$ \varepsilon >0 $$ such that the union of k$$ k $$ ‐uniform hypergraph on n$$ n $$ vertices with minimum codegree at least αn$$ \alpha n ...
Yulin Chang, Jie Han, L. Thoma
semanticscholar +1 more source