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 graph-theory
Search options not deleted
user 70313
Questions about the branch of combinatorics called graph theory (not to be used for questions concerning the graph of a function). This tag can be further specialized via using it in combination with more specialized tags such as extremal-graph-theory, spectral-graph-theory, algebraic-graph-theory, topological-graph-theory, random-graphs, graph-colorings and several others.
3
votes
What (fun) results in graph theory should undergraduates learn?
The fact that every planar graph is 4-colorable is certainly beyond the scope of an introductory course, but showing that every planar graph is 5-colorable is certainly doable.
1
vote
Diameter of random segment intersection graph?
I don't have sufficient privileges to add a comment, but I wanted to ask if your evidence is consistent with the conclusion that the diameter of $G$ increases logarithmically with $n$. That would hav …
- 553
1
vote
What (fun) results in graph theory should undergraduates learn?
Another interesting consequence of Euler's formula $V-E+F=2$ might include a proof that there are exactly five Platonic solids. Given that there are regular polygons with any number of sides, it ofte …