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 100631
Hypergraphs are generalizations of graphs, where edges can be made of more than two vertices.
6
votes
1
answer
392
views
Is an $O(n^{d-1})$ bound known for the maximum number of edges in an ordered $n$-vertex hype...
By a $d$-permutation hypergraph, I mean, for some fixed integer $k$, a $d$-uniform hypergraph on $[dk]$ with $k$ disjoint edges such that every edge has exactly one vertex from each of $\{1,\ldots,k\}$ … generalizes two results of Klazar and Marcus in https://arxiv.org/abs/math/0507164; Section 2 proves the statement when $d=2$ and Section 3 proves (or nearly proves proves) the case where the containing hypergraph …