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 inequalities
Search options not deleted
user 24076
for questions involving inequalities, upper and lower bounds.
3
votes
Accepted
Combinatorial Euclidean geometry problem
Since any graph with $d+1$ vertices can be realized as a unit distance graph in $\mathbb{R}^d$, with remaining distances smaller than $1$ (and arbitrarily close to 1), the question is then equivalent …
- 6,101
4
votes
Accepted
Forbidden Tripartite Graphs
The Erdos-Stone theorem is the reference you are looking for.
For every tripartite graph $G$, the number of edges in an $n$-vertex graph that guarantees $G$ as a subgraph is $n^2/4 + o(n^2)$. It is e …
- 6,101