Given a finite . n-element set . X, a family of subsets . F⊂2X is said to . separate X if any two elements of . X are separated by at least one member of . F. It is shown that if . |F|>2n-1, then one can select . ⌈log n⌉+1 members of . F that separate . X. If . |F|≥α2n for some .
A set A is said to split a finite set B if exactly half the elements of B (up to rounding) are conta...
A set A is said to split a finite set B if exactly half the elements of B (up to rounding) are conta...
AbstractIn this paper we define a completely separating system of an n-set, an extension of the conc...
Given a finite n-element set X, a family of subsets F ⊂ 2^X is said to separate X if any two element...
Given a finite n-element set X, a family of subsets F ⊂ 2X is said to separate X if any two element...
AbstractWe focus on families of bipartitions, i.e. set partitions consisting of at most two componen...
AbstractWe focus on families of bipartitions, i.e. set partitions consisting of at most two componen...
AbstractLet S be an n-element set. In this paper, we determine the smallest number f(n) for which th...
AbstractLet H be a finite set, and A1, A2, …, Am subsets of H. We call a system A separating system,...
AbstractA system A1,…,Am of subsets of X≔{1,…,n} is called a separating system if for any two distin...
AbstractLet H be a finite set, and A1, A2, …, Am subsets of H. We call a system A separating system,...
AbstractGiven k finite sets S1,…,Sk, to what extent is it possible to partition their union into two...
Dickson [On a problem concerning separating systems of a finite set, Journal of Combinatorial Theory...
Let H be a finite set, and A1, A2, ..., Am subsets of H. We call a system A separating system, if fo...
AbstractDickson (1969) introduced the notion of a completely separating set system. We study such sy...
A set A is said to split a finite set B if exactly half the elements of B (up to rounding) are conta...
A set A is said to split a finite set B if exactly half the elements of B (up to rounding) are conta...
AbstractIn this paper we define a completely separating system of an n-set, an extension of the conc...
Given a finite n-element set X, a family of subsets F ⊂ 2^X is said to separate X if any two element...
Given a finite n-element set X, a family of subsets F ⊂ 2X is said to separate X if any two element...
AbstractWe focus on families of bipartitions, i.e. set partitions consisting of at most two componen...
AbstractWe focus on families of bipartitions, i.e. set partitions consisting of at most two componen...
AbstractLet S be an n-element set. In this paper, we determine the smallest number f(n) for which th...
AbstractLet H be a finite set, and A1, A2, …, Am subsets of H. We call a system A separating system,...
AbstractA system A1,…,Am of subsets of X≔{1,…,n} is called a separating system if for any two distin...
AbstractLet H be a finite set, and A1, A2, …, Am subsets of H. We call a system A separating system,...
AbstractGiven k finite sets S1,…,Sk, to what extent is it possible to partition their union into two...
Dickson [On a problem concerning separating systems of a finite set, Journal of Combinatorial Theory...
Let H be a finite set, and A1, A2, ..., Am subsets of H. We call a system A separating system, if fo...
AbstractDickson (1969) introduced the notion of a completely separating set system. We study such sy...
A set A is said to split a finite set B if exactly half the elements of B (up to rounding) are conta...
A set A is said to split a finite set B if exactly half the elements of B (up to rounding) are conta...
AbstractIn this paper we define a completely separating system of an n-set, an extension of the conc...
DOI
Add to ORKG