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 combinatorial-designs
Search options answers only
not deleted
user 2233
Design theory is the subfield of combinatorics concerning the existence and construction of highly symmetric arrangements. Finite projective planes, latin squares, and Steiner triple systems are examples of designs.
6
votes
Intersecting 4-sets
For all even $n \geq 16$, $N:=\binom{n/2}{2}$ is the right answer.
Semi-proof. Let $n=2k$ and observe that $4N=2k(k-1)$. Thus, if more than $N$ sets appear, then some element $x$ occurs in at leas …
- 32.1k
6
votes
Accepted
Minimum covers of complete graphs by $4$-cycles
If $n$ is odd, the answer is $\lceil \binom{n}{2}/4 \rceil$.
If $n$ is even, the answer is $\lceil \binom{n}{2}/4+n/8 \rceil$.
This follows from two special cases of a more general conjecture by Als …
- 32.1k