AbstractIt is possible to find n partitions of an n-element set whose pairwise intersections are just all atoms of the partition lattice? Demetrovics, Füredi and Katona [4] verified this for all n ≡ 1 or 4 (mod 12) by constructing a series of special Mendelsohn Triple Systems. They conjectured that such triple systems exist for all n ≡ 1 (mod 3) and that the problem on the partitions has a solution for all n ⩾ 7. We prove that both conjectures are ture, except for finitely many n
AbstractA partition u of [ k ] = {1, 2,⋯ , k } is contained in another partition v of [ l ] if [ l ]...
AbstractThe principal result of this paper establishes the validity of a conjecture by Graham and Ro...
AbstractGiven B ⊆ 2[n], where [n] = {(1,…, n)}, let ν(B) denote the maximum size of a family F ⊆ 2 [...
AbstractWe continue our study of partitions of the set of all (v3) triples chosen from a v-set into ...
AbstractLet n and k be positive integers, k ⩾ 3. Denote by φ(n, k) the least positive integer such t...
AbstractLet S be an n-element set. In this paper, we determine the smallest number f(n) for which th...
In 2007, D.I. Panyushev defined a remarkable map on the set of nonnesting partitions (antichains in ...
AbstractLet A and S be subsets of the natural numbers. Let A′(n) be the number of partitions of n wh...
AbstractIn this note, a construction of the large sets of pairwise disjoint Mendelsohn triple system...
Let T be a collection of 3-element subsets S of {1,…,n} with the property that if i<j<k and a<b<c ...
AbstractLet N be the set of positive integers and A a subset of N. For n∈N, let p(A,n) denote the nu...
AbstractLet P be a finite poset covered by three nonempty disjoint chains T1, T2, and T3. Suppose th...
AbstractLet Δn and k be positive integers, k≥3. By an (l, n) system is meant a family of l distinct ...
AbstractWe continue our study of partitions of the full set of v3 triples chosen from a v-set into c...
AbstractWe prove that it is consistent with GCH (and in fact true in L) that there is a 0-dimensiona...
AbstractA partition u of [ k ] = {1, 2,⋯ , k } is contained in another partition v of [ l ] if [ l ]...
AbstractThe principal result of this paper establishes the validity of a conjecture by Graham and Ro...
AbstractGiven B ⊆ 2[n], where [n] = {(1,…, n)}, let ν(B) denote the maximum size of a family F ⊆ 2 [...
AbstractWe continue our study of partitions of the set of all (v3) triples chosen from a v-set into ...
AbstractLet n and k be positive integers, k ⩾ 3. Denote by φ(n, k) the least positive integer such t...
AbstractLet S be an n-element set. In this paper, we determine the smallest number f(n) for which th...
In 2007, D.I. Panyushev defined a remarkable map on the set of nonnesting partitions (antichains in ...
AbstractLet A and S be subsets of the natural numbers. Let A′(n) be the number of partitions of n wh...
AbstractIn this note, a construction of the large sets of pairwise disjoint Mendelsohn triple system...
Let T be a collection of 3-element subsets S of {1,…,n} with the property that if i<j<k and a<b<c ...
AbstractLet N be the set of positive integers and A a subset of N. For n∈N, let p(A,n) denote the nu...
AbstractLet P be a finite poset covered by three nonempty disjoint chains T1, T2, and T3. Suppose th...
AbstractLet Δn and k be positive integers, k≥3. By an (l, n) system is meant a family of l distinct ...
AbstractWe continue our study of partitions of the full set of v3 triples chosen from a v-set into c...
AbstractWe prove that it is consistent with GCH (and in fact true in L) that there is a 0-dimensiona...
AbstractA partition u of [ k ] = {1, 2,⋯ , k } is contained in another partition v of [ l ] if [ l ]...
AbstractThe principal result of this paper establishes the validity of a conjecture by Graham and Ro...
AbstractGiven B ⊆ 2[n], where [n] = {(1,…, n)}, let ν(B) denote the maximum size of a family F ⊆ 2 [...