Results 31 to 40 of about 64,068 (309)
Rainbow hamilton cycles in random graphs [PDF]
Random Structures & Algorithms, 2013 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.
Frieze, Alan, Loh, Po-Shen
openaire +2 more sources
Loose Hamilton Cycles in Regular Hypergraphs [PDF]
Combinatorics, Probability and Computing, 2014 We establish a relation between two uniform models of randomk-graphs (for constantk⩾ 3) onnlabelled vertices: ℍ(k)(n,m), the randomk-graph with exactlymedges, and ℍ(k)(n,d), the randomd-regulark-graph. By extending the switching technique of McKay and Wormald tok-graphs, we show that, for some range ofd = d(n)and a constantc> 0, ifm~cnd, then one ...
Dudek, Andrzej +3 more
openaire +2 more sources
Hamilton cycles in almost distance-hereditary graphs
Open Mathematics, 2016 Let G be a graph on n ≥ 3 vertices. A graph G is almost distance-hereditary if each connected induced subgraph H of G has the property dH(x, y) ≤ dG(x, y) + 1 for any pair of vertices x, y ∈ V(H).
Chen Bing, Ning Bo
doaj +1 more source
Electronic Journal of Graph Theory and Applications, 2021 A Hamiltonian graph G = (V,E) is called hyper-Hamiltonian if G-v is Hamiltonian for any v ∈ V(G). G is called a circulant if its automorphism group contains a |V(G)|-cycle.
Zbigniew R. Bogdanowicz
doaj +1 more source
Counting Hamilton Cycles in Dirac Hypergraphs
Combinatorica, 2023 AbstractFor $$0\le \ell <k$$ 0 ≤ ℓ < k , a Hamilton $$\ell $$ ℓ -cycle in a k-uniform hypergraph H is a cyclic ordering of the vertices of H in which the edges ...
Ferber, Asaf, Hardiman, Liam, Mond, Adva
openaire +1 more source
A Note on Barnette’s Conjecture
Discussiones Mathematicae Graph Theory, 2013 Barnette conjectured that each planar, bipartite, cubic, and 3-connected graph is hamiltonian. We prove that this conjecture is equivalent to the statement that there is a constant c > 0 such that each graph G of this class contains a path on at least c ...
Harant Jochen
doaj +1 more source
Hamilton ℓ-cycles in uniform hypergraphs
Journal of Combinatorial Theory, Series A, 2010 v3: corrected very minor error in Lemma 4.6 and the proof of Lemma 6 ...
Kühn, Daniela +2 more
openaire +2 more sources
Cards of fixed points of some Lotka-Volterra operators [PDF]
E-Journal of Analysis and Applied MathematicsThe paper considers a special type of the Lotka-Volterra operator operating in a four-dimensional simplex. The tournament corresponding to this operator has four cyclic triples. All kinds of fixed point cards are built for it. It is proved which types of
Dilfuza B. Eshmamatova +1 more
doaj +1 more source
Color‐biased Hamilton cycles in random graphs
Random Structures & Algorithms, 2021 AbstractWe prove that a random graph , with p above the Hamiltonicity threshold, is typically such that for any r‐coloring of its edges there exists a Hamilton cycle with at least edges of the same color. This estimate is asymptotically optimal.
Gishboliner, Lior +2 more
openaire +2 more sources
Notes on sufficient conditions for a graph to be Hamiltonian
International Journal of Mathematics and Mathematical Sciences, 1991 The first part of this paper deals with an extension of Dirac's Theorem to directed graphs. It is related to a result often referred to as the Ghouila-Houri Theorem.
Michael Joseph Paul +2 more
doaj +1 more source