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 80507
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.
2
votes
Type of directed graphs
For undirected graphs, this seems similar to the Friendship Graph--a graph in which, if two vertices are "friends" (i.e. share an edge), then they have exactly one common friend (i.e. exactly one new …
- 68
1
vote
Accepted
Can't lower bound be improved on number of light edges in planar graph with minimum degree f...
Theorem Every normal plane map of minimum vertex degree 5 satisfies
$\frac{14}{3} e_{5,5}+2e_{5,6}≥120.$
The author says the inequality cannot be improved. Since the following graph is constructed wi …
- 68