AbstractLet f(r,p,t) (p>t⩾1, r⩾2) be the maximum of the cardinality of a minimum transversal over all r-uniform hypergraphs H possessing the property that every subhypergraph of H with p edges has a transversal of size t. The values of f(r,p,2) for p=3,4,5,6 were found in Erdős et al. (Siberian Adv. Math. 2 (1992) 82–88). We give bounds on f(r,7,2), partially answering a question in Erdős et al. (1992)
We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n verti...
AbstractAnswering a 25-year-old problem of Erdös and Gallai, we prove that if a set system H of rank...
AbstractA set T is said to cover a set system J if T meets all members of J. We raise the following ...
AbstractThe main purpose of this paper is to prove that if H is a 4-uniform hypergraph with n vertic...
AbstractIf H is an r-uniform hypergraph of order p without (r + 1)-cliques, then the transversal num...
AbstractLet H=(V,E) be a hypergraph with vertex set V and edge set E of order nH=|V| and size mH=|E|...
AbstractLet H=(V,E) be a hypergraph with vertex set V and edge set E of order nH=|V| and size mH=|E|...
AbstractThe following dual version of Turán's problem is considered: for a given r-uniform hypergrap...
AbstractA subset of the vertices in a hypergraph is a cover if it intersects every edge. Let τ(H) de...
AbstractIf H is an r-uniform hypergraph of order p without (r + 1)-cliques, then the transversal num...
AbstractThe transversal number of a given hypergraph is the cardinality of the smallest set of verti...
AbstractLet t≥26 and let ℱ be a k-uniform hypergraph on n vertices. Suppose that |F1∩F2∩F3|≥t holds ...
A subset <i>S</i> of the vertex set of a hypergraph ℋ is called a dominating set of ℋ if for every v...
We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n verti...
We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n verti...
We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n verti...
AbstractAnswering a 25-year-old problem of Erdös and Gallai, we prove that if a set system H of rank...
AbstractA set T is said to cover a set system J if T meets all members of J. We raise the following ...
AbstractThe main purpose of this paper is to prove that if H is a 4-uniform hypergraph with n vertic...
AbstractIf H is an r-uniform hypergraph of order p without (r + 1)-cliques, then the transversal num...
AbstractLet H=(V,E) be a hypergraph with vertex set V and edge set E of order nH=|V| and size mH=|E|...
AbstractLet H=(V,E) be a hypergraph with vertex set V and edge set E of order nH=|V| and size mH=|E|...
AbstractThe following dual version of Turán's problem is considered: for a given r-uniform hypergrap...
AbstractA subset of the vertices in a hypergraph is a cover if it intersects every edge. Let τ(H) de...
AbstractIf H is an r-uniform hypergraph of order p without (r + 1)-cliques, then the transversal num...
AbstractThe transversal number of a given hypergraph is the cardinality of the smallest set of verti...
AbstractLet t≥26 and let ℱ be a k-uniform hypergraph on n vertices. Suppose that |F1∩F2∩F3|≥t holds ...
A subset <i>S</i> of the vertex set of a hypergraph ℋ is called a dominating set of ℋ if for every v...
We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n verti...
We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n verti...
We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n verti...
AbstractAnswering a 25-year-old problem of Erdös and Gallai, we prove that if a set system H of rank...
AbstractA set T is said to cover a set system J if T meets all members of J. We raise the following ...