AbstractA pair (A, B) of families of subsets of an n-element set X is cancellative if, for all A, A′ ϵ A and B, B′ ϵ B, the following conditions hold: A⧹B = A′⧹B ⇒ A = A′ and B⧹A = B′⧹A ⇒ B = B′. We prove that every such pair satisfies AB\̌gd , where τ = 2.3264. This is related to a conjecture of Erdõ and Katona on cancellative families and to a conjecture of Simonyi on recovering pairs. For the latter, our result gives the best known upper bound
Let F[subscript 1] and F[subscript 2] be two families of subsets of an n-element set. We say that F[...
AbstractSuppose that any t members (t⩾2) of a regular family on an n element set have at least k com...
Abstract Let F be a family of subsets of an n-element set. F is called (p,q)-chain intersecting if i...
A pair $(\mathcal{A},\mathcal{B})$ of families of subsets of an $n$-element set is called cancellati...
Following [2], we say a family, H, of subsets of a n-element set is cancellative if A[B = A[C implie...
A family of subsets of an n-set is 2-cancellative if, for every four-tuple {A,B, C,D} of its members...
International audienceA family of subsets of an $n$-set is $2$-cancellative if, for every four-tuple...
Given a family F of subsets of [n], we say two sets A,B ∈ F are comparable if A ⊂ B or B ⊂ A. Sperne...
Let F be a family of pairs of sets. We call it an (a, b)-set system if for every set-pair (A,B) in F...
AbstractLet A be a non-empty family of a-subsets of an n-element set and B a non-empty family of b-s...
A k-uniform family of subsets of [n] is intersecting if it does not contain a disjoint pair of sets....
Abstract. A family A of ‘-element subsets and a family B of k-element subsets of an n-element set ar...
AbstractGiven B ⊆ 2[n], where [n] = {(1,…, n)}, let ν(B) denote the maximum size of a family F ⊆ 2 [...
AbstractFix integers n,r⩾4 and let F denote a family of r-sets of an n-element set. Suppose that for...
AbstractLet fm(a,b,c,d) denote the maximum size of a family F of subsets of an m-element set for whi...
Let F[subscript 1] and F[subscript 2] be two families of subsets of an n-element set. We say that F[...
AbstractSuppose that any t members (t⩾2) of a regular family on an n element set have at least k com...
Abstract Let F be a family of subsets of an n-element set. F is called (p,q)-chain intersecting if i...
A pair $(\mathcal{A},\mathcal{B})$ of families of subsets of an $n$-element set is called cancellati...
Following [2], we say a family, H, of subsets of a n-element set is cancellative if A[B = A[C implie...
A family of subsets of an n-set is 2-cancellative if, for every four-tuple {A,B, C,D} of its members...
International audienceA family of subsets of an $n$-set is $2$-cancellative if, for every four-tuple...
Given a family F of subsets of [n], we say two sets A,B ∈ F are comparable if A ⊂ B or B ⊂ A. Sperne...
Let F be a family of pairs of sets. We call it an (a, b)-set system if for every set-pair (A,B) in F...
AbstractLet A be a non-empty family of a-subsets of an n-element set and B a non-empty family of b-s...
A k-uniform family of subsets of [n] is intersecting if it does not contain a disjoint pair of sets....
Abstract. A family A of ‘-element subsets and a family B of k-element subsets of an n-element set ar...
AbstractGiven B ⊆ 2[n], where [n] = {(1,…, n)}, let ν(B) denote the maximum size of a family F ⊆ 2 [...
AbstractFix integers n,r⩾4 and let F denote a family of r-sets of an n-element set. Suppose that for...
AbstractLet fm(a,b,c,d) denote the maximum size of a family F of subsets of an m-element set for whi...
Let F[subscript 1] and F[subscript 2] be two families of subsets of an n-element set. We say that F[...
AbstractSuppose that any t members (t⩾2) of a regular family on an n element set have at least k com...
Abstract Let F be a family of subsets of an n-element set. F is called (p,q)-chain intersecting if i...
DOI
Add to ORKG