Add to ORKGAMS Subject Classication: 05D05 Abstract. The function lattice, or generalized Boolean algebra, is the set of `-tuples with the ith coordinate an integer between 0 and a bound ni. Two `-tuples t-intersect if they have at least t common nonzero coordinates. We prove a HiltonMilner type theorem for systems of t-intersecting `-tuples
Two families $\mathcal{F},\mathcal{G}$ of $k$-subsets of $\{1,2,\ldots,n\}$ are called non-trivial c...
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...
With the publication of the famous Erdős-Ko-Rado Theorem in 1961, intersection problems became a po...
Ahlswede R, Bey C, Engel K, Khachatrian LH. The t-intersection problem in the truncated boolean latt...
AbstractLet I(n, t) be the class of all t -intersecting families of subsets of [ n ] and set Ik(n, t...
Let � I (n, t) be the class of all � t-intersecting � families of subsets of [n] and set Ik(n, t) =...
Recently we proved in [4] a complete intersection theorem for systems of finite sets. Now we establi...
AbstractIn a canonical way, we establish an AZ-identity (see [2]) and its consequences, the LYM-ineq...
AbstractThe authors have proved in a recent paper a complete intersection theorem for systems of fin...
Ahlswede R, Cai N. Incomparability and intersection properties of Boolean interval lattices and chai...
Ahlswede R, Khachatrian LH. The complete nontrivial-intersection theorem for systems of finite sets....
AbstractIf A and B are two systems of a-element and b-elementsets, respectively, and A ∩ B ≠ Ø for A...
The intersection graph of a set system S is a graph on the vertex set S, in which two vertices are c...
We consider the following game: Two players independently choose a chain in a partially ordered set....
AbstractWe introduce the concept of a bounded below set in a lattice. This can be used to give a gen...
Two families $\mathcal{F},\mathcal{G}$ of $k$-subsets of $\{1,2,\ldots,n\}$ are called non-trivial c...
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...
With the publication of the famous Erdős-Ko-Rado Theorem in 1961, intersection problems became a po...
Ahlswede R, Bey C, Engel K, Khachatrian LH. The t-intersection problem in the truncated boolean latt...
AbstractLet I(n, t) be the class of all t -intersecting families of subsets of [ n ] and set Ik(n, t...
Let � I (n, t) be the class of all � t-intersecting � families of subsets of [n] and set Ik(n, t) =...
Recently we proved in [4] a complete intersection theorem for systems of finite sets. Now we establi...
AbstractIn a canonical way, we establish an AZ-identity (see [2]) and its consequences, the LYM-ineq...
AbstractThe authors have proved in a recent paper a complete intersection theorem for systems of fin...
Ahlswede R, Cai N. Incomparability and intersection properties of Boolean interval lattices and chai...
Ahlswede R, Khachatrian LH. The complete nontrivial-intersection theorem for systems of finite sets....
AbstractIf A and B are two systems of a-element and b-elementsets, respectively, and A ∩ B ≠ Ø for A...
The intersection graph of a set system S is a graph on the vertex set S, in which two vertices are c...
We consider the following game: Two players independently choose a chain in a partially ordered set....
AbstractWe introduce the concept of a bounded below set in a lattice. This can be used to give a gen...
Two families $\mathcal{F},\mathcal{G}$ of $k$-subsets of $\{1,2,\ldots,n\}$ are called non-trivial c...
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...
With the publication of the famous Erdős-Ko-Rado Theorem in 1961, intersection problems became a po...