Results 11 to 20 of about 64,068 (309)
Resilience for loose Hamilton cycles
Procedia Computer Science, 2023 We study the emergence of loose Hamilton cycles in subgraphs of random hypergraphs. Our main result states that the minimum $d$-degree threshold for loose Hamiltonicity relative to the random $k$-uniform hypergraph $H_k(n,p)$ coincides with its dense analogue whenever $p \geq n^{- (k-1)/2+o(1)}$.
Alvarado, José D. +4 more
openaire +2 more sources
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
On Implicit Heavy Subgraphs and Hamiltonicity of 2-Connected Graphs
Discussiones Mathematicae Graph Theory, 2021 A graph G of order n is implicit claw-heavy if in every induced copy of K1,3 in G there are two non-adjacent vertices with sum of their implicit degrees at least n. We study various implicit degree conditions (including, but not limiting to, Ore- and Fan-
Zheng Wei, Wideł Wojciech, Wang Ligong
doaj +1 more source
Well-spread sequences and edge-labellings with constant Hamilton-weight [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 A sequence (a_i) of integers is \emphwell-spread if the sums a_i+a_j, for ...
Peter Mark Kayll
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
Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2013 16 pages, 7 figures, published on "Siam Journal on Discrete Mathematics"
Zhang, Zan-Bo +2 more
openaire +2 more sources
A Note Concerning Hamilton Cycles in Some Classes of Grid Graphs
Journal of Mathematical and Fundamental Sciences, 2013 A graph G is called hamiltonian if it contains a Hamilton cycle, i.e. a cycle containing all vertices. Deciding whether a given graph has a Hamilton cycle is an NP-complete problem. But, it is a polynomial problem within some special graph classes.
A. N.M. Salman +2 more
doaj +1 more source
Families of triples with high minimum degree are hamiltonian
Discussiones Mathematicae Graph Theory, 2014 In this paper we show that every family of triples, that is, a 3-uniform hypergraph, with minimum degree at least contains a tight Hamiltonian ...
Rödl Vojtech, Ruciński Andrzej
doaj +1 more source
Difference divisor graph of the finite group [PDF]
International Journal of Research in Industrial Engineering, 2018 Let (Zn, +) be a finite group of integers modulo n and Dn a non-empty subset of Zn containing proper devisors of n. In this paper, we have introduced the difference divisor graph Diff (Zn, Dn) associated with Zn whose vertices coincide with Zn such that ...
R. V M S S Kiran Kumar, T. Chalapathi
doaj +1 more source