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 not deleted
user 475875
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.
0
votes
1
answer
157
views
"JigSaw Puzzle" on Set Family
One of my research problem can be reduced to a question of the following form
Given a set family $\mathcal{F}$ of $[n]$ , such that every element of $[n]$ lies in exactly $K$ sets in $\mathcal{F}$, c …
- 384
2
votes
Does an $(x, bx)$-biregular graph always contain a $x$-regular bipartite subgraph?
Here is a heuristic reason why such a claim cannot hold. I cannot make the claim rigorous as I don't know enough about random biregular bipartite graphs.
If the claim indeed holds, then for any $(x, b …
- 384