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 24076
Hypergraphs are generalizations of graphs, where edges can be made of more than two vertices.
1
vote
Accepted
Chromatic self-maps on finite complete linear hypergraphs
By domotorp's answer https://mathoverflow.net/q/362229 to a previous question, De Bruijn-Erdos theorem characterizes complete linear collections as near-pencils or finite projective planes.
The image …
- 6,101
4
votes
Accepted
Optimal pseudotransversals
No, here is an example of a hypergraph with no optimal transversal. …
- 6,101
1
vote
Does any long path in a planar graph contain one of O(n) k-tuple of vertices?
For $k=3$ there are $O(n)$ such triples, in fact paths with three vertices.
Orient the planar graph $G$ so that the maximum outdegree is at most $3$. In such an orientation there are $O(n)$ paths wit …
- 6,101