The extremal-set-theory tag has no wiki summary.

**3**

votes

**1**answer

103 views

### Minimal family of k-sets containing all t-sets

Let $n \ge k \ge t \in \mathbb{N}$, and consider a universe $U$ of size $n$. Let $\mathcal{F}$ be a family of $k$-subsets of $U$, such that every $t$-subset of $U$ is contained in at least one member ...

**0**

votes

**1**answer

100 views

### Generalized Helly theorem for $t$-intersecting families

Given a family $\mathcal{F}$ of sets over ground set $X$, let $\tau(\mathcal{F})$ be the transversal number (aka blocking number), that is the cardinality of the smallest set of points $E \subseteq X$ ...

**5**

votes

**1**answer

166 views

### Can a partition free family in $2^{[n]}$ always be enlarged to one of size $2^{n-1}$?

Let $\left[ n \right]=\{{1,2,\cdots,n\}}$ and call a family $\mathcal{F} \subset 2^{\left[n\right]}$ partition-free if it does not contain any partition of $\left[n\right]$. A recent question asked ...

**3**

votes

**0**answers

558 views

### The state of art of the sunflower lemma

I am interesting in the sunflower system and its applications in computer science.
Given a Universe $U$ and a collection of $k$ sets $A_i$ is called a k-sunflower system if $A_i \cap A_j = Y $ for ...

**14**

votes

**5**answers

777 views

### Optimal bounds for an alternating sum on a downset

Let $n$ be a natural number, and consider the discrete cube $2^{[n]} := \{ A: A \subset \{1,\ldots,n\}\}$ consisting of all subsets of the $n$-element set $[n] := \{1,\ldots,n\}$. Define a downset in ...

**3**

votes

**1**answer

564 views

### Cyclic subgroups of finite abelian groups

I learned from MO Subgroups of a finite abelian group that the problem of enumerating subgroups (not up to isomorphism) of finite abelian groups is a difficult one.
Are there simple formulas if one ...

**4**

votes

**1**answer

444 views

### Intersecting Hamming spheres: is $|A\stackrel k+E|\ge|A|$?

Since my original posting some ten days ago, I discovered an amazing
example which changed significantly my perception of the problem.
Accordingly, the whole post got re-written now.
The most ...

**2**

votes

**1**answer

601 views

### Minimal generation for finite abelian groups

Let $G$ be a finite abelian group. I know of two ways of writing it as a direct sum of cyclic groups:
1) With orders $d_1, d_2, \ldots, d_k$ in such a way that $d_i|d_{i+1}$,
2) With orders that are ...

**15**

votes

**1**answer

492 views

### The hypercube: $|A {\stackrel2+} E| \ge |A|$?

I have a good motivation to ask the question below, but since the post is
already a little long, and the problem looks rather natural and appealing
(well, to me, at least), I'd rather go straight to ...

**3**

votes

**1**answer

210 views

### Lower bounding the maximum size of sets in a set family with union promise

The following problem has come up while working on the relationship between certificate and randomized decision tree complexities of boolean functions. However, I think it is of interest by itself and ...

**14**

votes

**1**answer

948 views

### How to keep subsets disjoint?

Given positive integers $n$ and $k\le 2^n$, how to choose a subset $C\subset\{0,1\}^n$ of size $|C|=k$ to maximize the number of pairs $(c_1,c_2)\in C\times C$ with the supports of $c_1$ and $c_2$ ...

**6**

votes

**2**answers

319 views

### What is the largest family F of subsets of [n] for which any two distinct sets A and B in F have an intersection of size at most min(|A|,|B|)/2?

This problem arose in the study of Latin squares with a large number of subsquares, although it appears interesting in its own right.
Question: What is the maximum cardinality of a family $F ...

**6**

votes

**1**answer

362 views

### Upper bound for the size of a $k$-uniform $s$-wise $t$-intersecting set system

Given integers $n \geq k \geq t \geq 1$ and an integer $s$, let $m(n,k,s,t)$ denote the maximum size of a family $\mathcal F$ of $k$-subsets of $[n]$, i.e. $\mathcal F \subseteq \binom{[n]}{k}$, such ...