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 34180
Hypergraphs are generalizations of graphs, where edges can be made of more than two vertices.
4
votes
What are the applications of hypergraphs?
Every finite geometry (projective planes, generalized polygons, polar spaces, near polygons, etc.) and every block design (Witt design, difference sets, Steiner triple systems, etc.) is a hypergraph. …
5
votes
0
answers
232
views
A question on hyperplanes in partial linear spaces and hypergraphs
A partial linear space (or a linear hypergraph) is a point line geometry $(P,L,I)$ where for every pair of points there is at most one line incident with both of them. … This can also be formulated in terms of finding certain kind of subsets of the vertex set in a $r$-uniform hypergraph. …
- 1,197
4
votes
2
answers
380
views
Finding the set of all $0$-$1$ vectors in an affine subspace
Edit: If the row sum is $r$ and column sum $s$ then this can be interpreted as finding perfect matchings in an $s$-uniform $r$-regular hypergraph. … The smallest case I am interested in is a $5$-uniform $5$-regular linear hypergraph (at most one edge through every pair of vertices) which has $1365$ edges (and the same number of vertices). …
- 1,197