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 hypergraph
Search options not deleted
user 45255
Hypergraphs are generalizations of graphs, where edges can be made of more than two vertices.
2
votes
Constructions of $2-(v,3,3)$-designs
Yuichiro's is the best answer, but here's another "cheat" answer (which I nonetheless think is kind of neat):
Take a PBD$(v,\{3,5\})$, triple each block of size three, and replace each block of size …
- 1,091