AbstractLet S be a set of n elements, and k a fixed positive integer <12n. Katona's problem is to determine the smallest integer m for which there exists a family A = {A1, …, Am} of subsets of S with the following property: |i| ⩽ k (i = 1, …, m), and for any ordered pair xi, xi ∈ S (i ≠ j) there is A1 ∈ A such that xi ∈ A1, xj ∉ A1. It is given in this note that m = ⌈2nk⌉ if12k2 ⩾ 2
AbstractIn this paper we define a completely separating system of an n-set, an extension of the conc...
Abstract. We present a short proof that every maximal family of weakly separated subsets of [n] of c...
AbstractLet n and k be fixed positive integers. A collection C of k-sets of [n] is a completely sepa...
AbstractLet S be a set of n elements, and k a fixed positive integer <12n. Katona's problem is to de...
AbstractLet S be an n-element set. In this paper, we determine the smallest number f(n) for which th...
AbstractLet S be an n-element set. In this paper, we determine the smallest number f(n) for which th...
AbstractA system A1,…,Am of subsets of X≔{1,…,n} is called a separating system if for any two distin...
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,...
R(n) denotes the minimum possible size of a completely separating system C on an n-set. R(n, h, k) d...
AbstractDickson (1969) introduced the notion of a completely separating set system. We study such sy...
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,...
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...
AbstractIn this paper we define a completely separating system of an n-set, an extension of the conc...
Abstract. We present a short proof that every maximal family of weakly separated subsets of [n] of c...
AbstractLet n and k be fixed positive integers. A collection C of k-sets of [n] is a completely sepa...
AbstractLet S be a set of n elements, and k a fixed positive integer <12n. Katona's problem is to de...
AbstractLet S be an n-element set. In this paper, we determine the smallest number f(n) for which th...
AbstractLet S be an n-element set. In this paper, we determine the smallest number f(n) for which th...
AbstractA system A1,…,Am of subsets of X≔{1,…,n} is called a separating system if for any two distin...
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,...
R(n) denotes the minimum possible size of a completely separating system C on an n-set. R(n, h, k) d...
AbstractDickson (1969) introduced the notion of a completely separating set system. We study such sy...
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,...
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...
AbstractIn this paper we define a completely separating system of an n-set, an extension of the conc...
Abstract. We present a short proof that every maximal family of weakly separated subsets of [n] of c...
AbstractLet n and k be fixed positive integers. A collection C of k-sets of [n] is a completely sepa...
DOI
Add to ORKG