AbstractLet S be an n-element set. In this paper, we determine the smallest number f(n) for which there exists a family of subsets of S{A1,A2,…,Af(n)} with the following property: Given any two elements x, y ∈ S (x ≠ y), there exist k, l such that Ak ∩ Al= ∅, and x ∈ Ak, y ∈ Al. In particular it is shown that f(n)= 3 log3n when n is a power of 3
AbstractLet F be a family of subsets of an n-element set not containing four distinct members such t...
Given a finite . n-element set . X, a family of subsets . F⊂2X is said to . separate X if any two el...
Given a finite n-element set X, a family of subsets F ⊂ 2^X is said to separate X if any two element...
AbstractLet S be an n-element set. In this paper, we determine the smallest number f(n) for which th...
AbstractLet S be a set of n elements, and k a fixed positive integer <12n. Katona's problem is to de...
AbstractLet S be a set of n elements, and k a fixed positive integer <12n. Katona's problem is to de...
AbstractA system A1,…,Am of subsets of X≔{1,…,n} is called a separating system if for any two distin...
AbstractLet Δn and k be positive integers, k≥3. By an (l, n) system is meant a family of l distinct ...
AbstractLet G be a finite loopless graph with vertex-set V(G) and edge-set E(G). Edmonds' problem is...
AbstractLet H be a finite set, and A1, A2, …, Am subsets of H. We call a system A separating system,...
AbstractLet n and k be fixed positive integers. A collection C of k-sets of [n] is a completely sepa...
AbstractLet G be a finite loopless graph with vertex-set V(G) and edge-set E(G). Edmonds' problem is...
Given a finite n-element set X, a family of subsets F ⊂ 2X is said to separate X if any two element...
AbstractWe improve the lower and upper bounds reported by Herzog and Schönheim for mr(p), the minimu...
AbstractThis paper is a survey of open problems and results involving extremal size of collections o...
AbstractLet F be a family of subsets of an n-element set not containing four distinct members such t...
Given a finite . n-element set . X, a family of subsets . F⊂2X is said to . separate X if any two el...
Given a finite n-element set X, a family of subsets F ⊂ 2^X is said to separate X if any two element...
AbstractLet S be an n-element set. In this paper, we determine the smallest number f(n) for which th...
AbstractLet S be a set of n elements, and k a fixed positive integer <12n. Katona's problem is to de...
AbstractLet S be a set of n elements, and k a fixed positive integer <12n. Katona's problem is to de...
AbstractA system A1,…,Am of subsets of X≔{1,…,n} is called a separating system if for any two distin...
AbstractLet Δn and k be positive integers, k≥3. By an (l, n) system is meant a family of l distinct ...
AbstractLet G be a finite loopless graph with vertex-set V(G) and edge-set E(G). Edmonds' problem is...
AbstractLet H be a finite set, and A1, A2, …, Am subsets of H. We call a system A separating system,...
AbstractLet n and k be fixed positive integers. A collection C of k-sets of [n] is a completely sepa...
AbstractLet G be a finite loopless graph with vertex-set V(G) and edge-set E(G). Edmonds' problem is...
Given a finite n-element set X, a family of subsets F ⊂ 2X is said to separate X if any two element...
AbstractWe improve the lower and upper bounds reported by Herzog and Schönheim for mr(p), the minimu...
AbstractThis paper is a survey of open problems and results involving extremal size of collections o...
AbstractLet F be a family of subsets of an n-element set not containing four distinct members such t...
Given a finite . n-element set . X, a family of subsets . F⊂2X is said to . separate X if any two el...
Given a finite n-element set X, a family of subsets F ⊂ 2^X is said to separate X if any two element...
DOI
Add to ORKG