Results 31 to 40 of about 33,701 (288)

A short proof of the middle levels theorem

open access: yesDiscrete Analysis, 2018
A short proof of the middle-levels theorem, Discrete Analysis 2018:8, 12 pp. Let $n$ be a positive integer, and define a bipartite graph where one vertex set consists of all subsets of $\{1,2,\dots,2n+1\}$ of size $n$, the other consists of all subsets ...
Petr Gregor   +2 more
doaj   +1 more source

Rainbow hamilton cycles in random graphs [PDF]

open access: yesRandom 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]

open access: yesCombinatorics, 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

Method to generate the pseudo random sequence based on the statistical properties

open access: yes网络与信息安全学报, 2017
There are some problems existing in pseudo-random sequence generating methods, such as the weaker proportionality, bad run length characteristic, etc. Hence, based on the SimiHam algorithm in Knight's tour problem, a pseudo-random sequences generating ...
Sen BAI, Long-fu ZHOU, Hui GUO, Bing YAN
doaj   +3 more sources

Counting Hamilton Cycles in Dirac Hypergraphs

open access: yesCombinatorica, 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

Hamilton ℓ-cycles in uniform hypergraphs

open access: yesJournal 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

A High-Resolution Lead-Lag Analysis of US GDP, Employment, and Unemployment 1977–2021: Okun’s Law and the Puzzle of Jobless Recovery

open access: yesEconomies, 2022
Okun’s law is formulated as the ratio between GDP and unemployment (UE): β = f(GDP/UE). It is used to investigate the relations between output and labor input across regions or across business cycles. Based on results by James D. Hamilton we replaced the
Knut Lehre Seip, Dan Zhang
doaj   +1 more source

Color‐biased Hamilton cycles in random graphs

open access: yesRandom 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

Nestmate Copulation in the Neotropical Eusocial Wasp Polistes Instabilis de Saussure (Hymenoptera: Vespidae)

open access: yesPsyche: A Journal of Entomology, 1994
Copulation between individually marked nestmates of the Neotropical eusocial wasp Polistes instabilis is reported. Polistes copulations are rarely observed in the field; this observation is the first documented case of nestmate copulation in the genus ...
Sean O'Donnell
doaj   +1 more source

Grafos hamiltonianos en el diseño de viajes

open access: yesModelling in Science Education and Learning, 2013
The existence and, if applicable, the location of paths with given properties is a topic in graph theory. One of these problems is to find routes through all points, only once, starting and ending at the same node.
Cristina Jordán Lluch   +1 more
doaj   +1 more source

Home - About - Disclaimer - Privacy