Results 11 to 20 of about 3,567,425 (361)
A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree. [PDF]
Springerplus, 2016 A Hamiltonian cycle in a graph is a cycle that visits each node/vertex exactly once. A graph containing a Hamiltonian cycle is called a Hamiltonian graph.
Nagoor Gani A, Latha SR.
europepmc +4 more sources
Powers of Hamilton cycles in pseudorandom graphs [PDF]
Combinatorica, 2014 30 pages, 1 ...
Peter J. Allen +4 more
core +8 more sources
The threshold for the square of a Hamilton cycle [PDF]
Proceedings of the American Mathematical Society, 2020 Resolving a conjecture of Kühn and Osthus from 2012, we show that p = 1 / n p= 1/\sqrt {n} is the threshold for the random graph G n
J. Kahn +2 more
semanticscholar +5 more sources
Discrete Mathematics, 1993 If the complete graph on \(n\) vertices is edge-colored such that the number of times that a color may occur is less than \(cn/\log(n)\), where \(c\) is a fixed constant, then there is a Hamiltonian cycle in which no two edges have the same color.
Alan Frieze, Bruce Reed
openalex +3 more sources
Symmetric Hamilton Cycle Decompositions of Complete Multigraphs
Discussiones Mathematicae Graph Theory, 2013 Let n ≥ 3 and ⋋ ≥ 1 be integers. Let ⋋Kn denote the complete multigraph with edge-multiplicity ⋋. In this paper, we show that there exists a symmetric Hamilton cycle decomposition of ⋋K2m for all even ⋋ ≥ 2 and m ≥ 2.
Chitra V., Muthusamy A.
doaj +2 more sources
Hamilton cycles in quasirandom hypergraphs [PDF]
Random Structures & Algorithms, 2016 We show that, for a natural notion of quasirandomness in $k$-uniform hypergraphs, any quasirandom $k$-uniform hypergraph on $n$ vertices with constant edge density and minimum vertex degree $ (n^{k-1})$ contains a loose Hamilton cycle. We also give a construction to show that a $k$-uniform hypergraph satisfying these conditions need not contain a ...
Dhruv Mubayi, Richard Mycroft, John Lenz
openaire +6 more sources
Matchings and Hamilton cycles in hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 It is well known that every bipartite graph with vertex classes of size $n$ whose minimum degree is at least $n/2$ contains a perfect matching. We prove an analogue of this result for uniform hypergraphs. We also provide an analogue of Dirac's theorem on
Daniela Kühn, Deryk Osthus
doaj +3 more sources
Packing Hamilton Cycles Online [PDF]
Combinatorics, Probability and Computing, 2016 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.
Joseph Briggs +4 more
openalex +5 more sources
Rainbow Hamilton cycles in random graphs [PDF]
Random Structures & Algorithms, 2011 AbstractOne of the most famous results in the theory of random graphs establishes that the threshold for Hamiltonicity in the Erdős‐Rényi random graph Gn,p is around . Much research has been done to extend this to increasingly challenging random structures.
Alan Frieze, Po‐Shen Loh
openalex +5 more sources
Fast strategies in biased Maker--Breaker games [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the biased $(1:b)$ Maker--Breaker positional games, played on the edge set of the complete graph on $n$ vertices, $K_n$. Given Breaker's bias $b$, possibly depending on $n$, we determine the bounds for the minimal number of moves, depending on ...
Mirjana Mikalački, Miloš Stojaković
doaj +3 more sources