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 50335
Hypergraphs are generalizations of graphs, where edges can be made of more than two vertices.
4
votes
2
answers
260
views
Known result about existence of $n$-vertex $k$-uniform $r$-hypergraphs?
Here a hypergraph consists of a vertex set $V$ and a hyperedge set $\mathcal{E}$, which is a family of subsets of $V$, and '$n$-vertex' means $|V|=n$, and '$k$-unform' means each set in $\mathcal{E}$ is …
- 281