Add to ORKGA typical problem in extremal combinatorics is the following. Given a large number n and a set L, find the maximum cardinality of a family of subsets of a ground set of n elements such that the intersection of any two subsets has cardinality in L. We investigate the generalization of this problem, where intersections of more than 2 subsets are considered. In particular, we prove that when k−1 is a power of 2, the size of the extremal k-wise oddtown family is (k−1)(n− 2log2(k−1)). Tight bounds are also found in several other basic case
With the publication of the famous Erdős-Ko-Rado Theorem in 1961, intersection problems became a pop...
AbstractWe study maximum cardinality families of pairwise intersecting subsets of an n-set. We give ...
AbstractThe Erdős–Ko–Rado theorem tells us how large an intersecting family of r-sets from an n-set ...
AbstractA large variety of problems and results in Extremal Set Theory deal with estimates on the si...
AbstractA large variety of problems and results in Extremal Set Theory deal with estimates on the si...
We study the maximum cardinality of a pairwise-intersecting family of subsets of an n-set, or the si...
AbstractLet n and k be positive integers, k ⩾ 3. Denote by φ(n, k) the least positive integer such t...
A family $\mathcal{F}$ of subsets of $\{1,\dots,n\}$ is called $k$-wise intersecting if any $k$ memb...
In this dissertation, we examine various problems in extremal set theory, which typically entails ma...
In this dissertation, we examine various problems in extremal set theory, which typically entails ma...
AbstractThis paper investigates the maximum possible size of families ℱ of t-valued functions on an ...
All the graphs considered are simple, i.e., without loops or multiple edges. The intersection of two...
A family $\mathcal{F}$ on ground set $[n]:=\{1,2,\ldots, n\}$ is maximal $k$-wise intersecting if ev...
AbstractLet X = [1, n] be a finite set of cardinality n and let F be a family of k-subsets of X. Sup...
We study the maximum cardinality of a pairwise-intersecting family of subsets of an n-set, or the si...
With the publication of the famous Erdős-Ko-Rado Theorem in 1961, intersection problems became a pop...
AbstractWe study maximum cardinality families of pairwise intersecting subsets of an n-set. We give ...
AbstractThe Erdős–Ko–Rado theorem tells us how large an intersecting family of r-sets from an n-set ...
AbstractA large variety of problems and results in Extremal Set Theory deal with estimates on the si...
AbstractA large variety of problems and results in Extremal Set Theory deal with estimates on the si...
We study the maximum cardinality of a pairwise-intersecting family of subsets of an n-set, or the si...
AbstractLet n and k be positive integers, k ⩾ 3. Denote by φ(n, k) the least positive integer such t...
A family $\mathcal{F}$ of subsets of $\{1,\dots,n\}$ is called $k$-wise intersecting if any $k$ memb...
In this dissertation, we examine various problems in extremal set theory, which typically entails ma...
In this dissertation, we examine various problems in extremal set theory, which typically entails ma...
AbstractThis paper investigates the maximum possible size of families ℱ of t-valued functions on an ...
All the graphs considered are simple, i.e., without loops or multiple edges. The intersection of two...
A family $\mathcal{F}$ on ground set $[n]:=\{1,2,\ldots, n\}$ is maximal $k$-wise intersecting if ev...
AbstractLet X = [1, n] be a finite set of cardinality n and let F be a family of k-subsets of X. Sup...
We study the maximum cardinality of a pairwise-intersecting family of subsets of an n-set, or the si...
With the publication of the famous Erdős-Ko-Rado Theorem in 1961, intersection problems became a pop...
AbstractWe study maximum cardinality families of pairwise intersecting subsets of an n-set. We give ...
AbstractThe Erdős–Ko–Rado theorem tells us how large an intersecting family of r-sets from an n-set ...