AbstractIn this note, we determine the maximum number of edges of a k-uniform hypergraph, k≥3, with a unique perfect matching. This settles a conjecture proposed by Snevily
summary:For an integer $k\ge2$ and a $k$-uniform hypergraph $H$, let $\delta_{k-1}(H)$ be the larges...
AbstractSoit H = (X,F) un hypergraphe h-uniforme avec ∥X∥ = n et soit Lh±1(H) le graphe dont les som...
AbstractLet H be a hypergraph. For a k-edge coloring c:E(H)→{1,…,k} let f(H,c) be the number of comp...
In this note, we determine the maximum number of edges of a k-uniform hypergraph, k\u3c3, with a uni...
Abstract. Following the article “On the maximum number of edges in a k-uniform hypergraph with a uni...
Abstract. In 1965 Erdős conjectured that the number of edges in k-uniform hypergraphs on n vertices...
More than forty years ago, Erdős conjectured that for any , every k-uniform hypergraph on n vertices...
AbstractWe prove that the maximum number of edges in a k-uniform hypergraph on n vertices containing...
AbstractWe define a perfect matching in a k-uniform hypergraph H on n vertices as a set of ⌊n/k⌋ dis...
Let fr(n) be the maximum number of edges in an r-uniform hypergraph on n vertices that does not cont...
AbstractFix l⩾r⩾2. Let Hl+1(r) be the r-uniform hypergraph obtained from the complete graph Kl+1 by ...
Let be an odd integer and let n be a sufficiently large integer. We prove that the maximum number o...
AbstractLet fr(n) be the maximum number of edges in an r-uniform hypergraph on n vertices that does ...
AbstractIn this paper we study degree conditions which guarantee the existence of perfect matchings ...
AbstractThe transversal number of a given hypergraph is the cardinality of the smallest set of verti...
summary:For an integer $k\ge2$ and a $k$-uniform hypergraph $H$, let $\delta_{k-1}(H)$ be the larges...
AbstractSoit H = (X,F) un hypergraphe h-uniforme avec ∥X∥ = n et soit Lh±1(H) le graphe dont les som...
AbstractLet H be a hypergraph. For a k-edge coloring c:E(H)→{1,…,k} let f(H,c) be the number of comp...
In this note, we determine the maximum number of edges of a k-uniform hypergraph, k\u3c3, with a uni...
Abstract. Following the article “On the maximum number of edges in a k-uniform hypergraph with a uni...
Abstract. In 1965 Erdős conjectured that the number of edges in k-uniform hypergraphs on n vertices...
More than forty years ago, Erdős conjectured that for any , every k-uniform hypergraph on n vertices...
AbstractWe prove that the maximum number of edges in a k-uniform hypergraph on n vertices containing...
AbstractWe define a perfect matching in a k-uniform hypergraph H on n vertices as a set of ⌊n/k⌋ dis...
Let fr(n) be the maximum number of edges in an r-uniform hypergraph on n vertices that does not cont...
AbstractFix l⩾r⩾2. Let Hl+1(r) be the r-uniform hypergraph obtained from the complete graph Kl+1 by ...
Let be an odd integer and let n be a sufficiently large integer. We prove that the maximum number o...
AbstractLet fr(n) be the maximum number of edges in an r-uniform hypergraph on n vertices that does ...
AbstractIn this paper we study degree conditions which guarantee the existence of perfect matchings ...
AbstractThe transversal number of a given hypergraph is the cardinality of the smallest set of verti...
summary:For an integer $k\ge2$ and a $k$-uniform hypergraph $H$, let $\delta_{k-1}(H)$ be the larges...
AbstractSoit H = (X,F) un hypergraphe h-uniforme avec ∥X∥ = n et soit Lh±1(H) le graphe dont les som...
AbstractLet H be a hypergraph. For a k-edge coloring c:E(H)→{1,…,k} let f(H,c) be the number of comp...
DOI
Add to ORKG