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 coarse-geometry
Search options answers only
not deleted
user 4312
19
votes
Accepted
Universal graph
I think that the answer is negative.
Assume that such graph $G$ on the vertex set $\{v_1,v_2,\ldots\}$ exists. We construct our not-embeddable graph $H$ on $\{1,2,\ldots\}$ by steps. On the $i$-th ste …
- 109k