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 934
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.
1
vote
Accepted
Strongly asymmetric graphs
I believe the common name for such graphs is rigid. In fact, most random graphs are rigid. See this reference: On the minimal order of a graphs within a semigroup.
- 4,952
4
votes
Accepted
Where can I find a catalog of known Ramsey numbers?
MathWorld has a pretty decent list (scroll down in the link) and cites numerous papers with good bounds
http://mathworld.wolfram.com/RamseyNumber.html
- 4,952
4
votes
0
answers
462
views
System of Equations Upper Bound
I asked a related question on math.stackexchange here but would now like to obtain a better bound. This question comes from a graph theory problem. I'll restate the new question here:
For $i=1,2,\ldo …
- 4,952
1
vote
1
answer
361
views
Winding number bijection on graphs
Let $G=(V,E)$ be an isoradial graph. In other words the graph can be imbedded into the plane such that each face (plaquette) can be circumscribed a circle of radius 1 with the circle's center belongin …
- 4,952