Add to ORKGoriginal source http://www.cambridge.org/journals/journal_catalogue.asp?mnemonic=CPCWe show that r-regular, s-uniform hypergraphs contain a perfect matching with high probability (whp), provided s > 1 + log r / (r-1)log(r/(r-1)) . The based on the application of a technique of Robinson and Wormald [7,8]. The space of hypergraphs is partitioned into subsets according to the number of small cycles in the hypergraph. The difference in the expected number of perfect matchings between these subsets explains most of the variance of the number of perfect matchings in the space of hypergraphs, and is sufficient to prove existence (whp), using the Chebychev Inequality
Let k ≥ 2 and F be a linear k-uniform hypergraph with v vertices. We prove that if n is sufficiently...
Abstract. Following the article “On the maximum number of edges in a k-uniform hypergraph with a uni...
We study the complexity of proving that a sparse random regular graph on an odd number of vertices d...
original source http://www.cambridge.org/journals/journal_catalogue.asp?mnemonic=CPCWe show that r-r...
The question of finding the threshold for perfect matchings in random k-uniform hypergraphs dates ba...
AbstractStrengthening the result of Rődl and Frankl (Europ. J. Combin 6 (1985) 317–326), Pippenger p...
Let $m_d(k,n)$ be the minimal $m$ such that every $k$-uniform hypergraph on $n$ vertices and with mi...
AbstractWe consider the following model Hr(n, p) of random r-uniform hypergraphs. The vertex set con...
AbstractIt is shown that d-pure hypergraphs with n vertices and more than n32 random edges contain a...
AbstractIn this paper we study degree conditions which guarantee the existence of perfect matchings ...
As proved in [2], every ffl-regular graph G on vertex set V1 [V2 , jV 1 j = jV 2 j = n, with densit...
AbstractWe define a perfect matching in a k-uniform hypergraph H on n vertices as a set of ⌊n/k⌋ dis...
A celebrated theorem of Pippenger, and Frankl and R\"odl states that every almost-regular, uniform h...
We prove the convergence in probability of free energy for matchings on random regular, uniform hype...
summary:For an integer $k\ge2$ and a $k$-uniform hypergraph $H$, let $\delta_{k-1}(H)$ be the larges...
Let k ≥ 2 and F be a linear k-uniform hypergraph with v vertices. We prove that if n is sufficiently...
Abstract. Following the article “On the maximum number of edges in a k-uniform hypergraph with a uni...
We study the complexity of proving that a sparse random regular graph on an odd number of vertices d...
original source http://www.cambridge.org/journals/journal_catalogue.asp?mnemonic=CPCWe show that r-r...
The question of finding the threshold for perfect matchings in random k-uniform hypergraphs dates ba...
AbstractStrengthening the result of Rődl and Frankl (Europ. J. Combin 6 (1985) 317–326), Pippenger p...
Let $m_d(k,n)$ be the minimal $m$ such that every $k$-uniform hypergraph on $n$ vertices and with mi...
AbstractWe consider the following model Hr(n, p) of random r-uniform hypergraphs. The vertex set con...
AbstractIt is shown that d-pure hypergraphs with n vertices and more than n32 random edges contain a...
AbstractIn this paper we study degree conditions which guarantee the existence of perfect matchings ...
As proved in [2], every ffl-regular graph G on vertex set V1 [V2 , jV 1 j = jV 2 j = n, with densit...
AbstractWe define a perfect matching in a k-uniform hypergraph H on n vertices as a set of ⌊n/k⌋ dis...
A celebrated theorem of Pippenger, and Frankl and R\"odl states that every almost-regular, uniform h...
We prove the convergence in probability of free energy for matchings on random regular, uniform hype...
summary:For an integer $k\ge2$ and a $k$-uniform hypergraph $H$, let $\delta_{k-1}(H)$ be the larges...
Let k ≥ 2 and F be a linear k-uniform hypergraph with v vertices. We prove that if n is sufficiently...
Abstract. Following the article “On the maximum number of edges in a k-uniform hypergraph with a uni...
We study the complexity of proving that a sparse random regular graph on an odd number of vertices d...