DOIAbstract
We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect matching
We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect matching
AbstractLet H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there e...
AbstractWe define a perfect matching in a k-uniform hypergraph H on n vertices as a set of ⌊n/k⌋ dis...
It is known that finding a perfect matching in a general graph is AC0-equivalent to finding a perfe...
We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect mat...
AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...
AbstractGiven positive integers k and ℓ where 4 divides k and k/2⩽ℓ⩽k−1, we give a minimum ℓ-degree ...
Abstract. We determine the exact minimum ℓ-degree threshold for perfect matchings in k-uniform hyper...
We establish a new lower bound on the l-wise collective minimum degree which guarantees the existenc...
AbstractGiven positive integers k and ℓ where 4 divides k and k/2⩽ℓ⩽k−1, we give a minimum ℓ-degree ...
AbstractWe establish a new lower bound on the l-wise collective minimum degree which guarantees the ...
Abstract. In this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse ...
AbstractIn this paper we study degree conditions which guarantee the existence of perfect matchings ...
Let H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there exist two...
We develop a theory for the existence of perfect matchings in hypergraphs under quite general condit...
summary:For an integer $k\ge2$ and a $k$-uniform hypergraph $H$, let $\delta_{k-1}(H)$ be the larges...
AbstractLet H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there e...
AbstractWe define a perfect matching in a k-uniform hypergraph H on n vertices as a set of ⌊n/k⌋ dis...
It is known that finding a perfect matching in a general graph is AC0-equivalent to finding a perfe...
We will give a tight minimum co-degree condition for a 4-uniform hypergraph to contain a perfect mat...
AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...
AbstractGiven positive integers k and ℓ where 4 divides k and k/2⩽ℓ⩽k−1, we give a minimum ℓ-degree ...
Abstract. We determine the exact minimum ℓ-degree threshold for perfect matchings in k-uniform hyper...
We establish a new lower bound on the l-wise collective minimum degree which guarantees the existenc...
AbstractGiven positive integers k and ℓ where 4 divides k and k/2⩽ℓ⩽k−1, we give a minimum ℓ-degree ...
AbstractWe establish a new lower bound on the l-wise collective minimum degree which guarantees the ...
Abstract. In this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse ...
AbstractIn this paper we study degree conditions which guarantee the existence of perfect matchings ...
Let H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there exist two...
We develop a theory for the existence of perfect matchings in hypergraphs under quite general condit...
summary:For an integer $k\ge2$ and a $k$-uniform hypergraph $H$, let $\delta_{k-1}(H)$ be the larges...
AbstractLet H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there e...
AbstractWe define a perfect matching in a k-uniform hypergraph H on n vertices as a set of ⌊n/k⌋ dis...
It is known that finding a perfect matching in a general graph is AC0-equivalent to finding a perfe...
Add to ORKG