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 475875
Hypergraphs are generalizations of graphs, where edges can be made of more than two vertices.
2
votes
Does an $(x, bx)$-biregular graph always contain a $x$-regular bipartite subgraph?
Here is a heuristic reason why such a claim cannot hold. I cannot make the claim rigorous as I don't know enough about random biregular bipartite graphs.
If the claim indeed holds, then for any $(x, b …
- 384
11
votes
0
answers
194
views
Number of triangle-free graphs with prescribed number of edges
Conjecture: Let $G$ be the $3$-uniform linear hypergraph whose vertex set is $\binom{[n]}{2}$, and whose edge set is $\{\{i,j\},\{j, k\}, \{k, i\}\}$ for distinct $i,j,k\in [n]$. …
- 384