Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with extremal-combinatorics
Search options not deleted
user 27829
3
votes
Accepted
Minimal family of k-sets containing all t-sets
I think it is an optimal version of a covering with index $1$.
A $t$-$(n,k,\lambda)$ covering is an ordered pair $(U,\mathcal{B})$ of a finite set $U$ of cardinality $n$ and a finite set $\mathcal{B} …
- 3,692
2
votes
Upper bound for the size of a $k$-uniform $s$-wise $t$-intersecting set system
This is not as general as what is asked, but in N. Tokushige, The random walk method for intersecting families, in Horizons of Combinatorics, Bolyai Society Mathematical Studies, 17 (2008) 215-224, it …
- 3,692