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 136356
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
1
answer
108
views
Is there a ternary Cayley graph on 27 vertices that is a non-complete core?
Is there a non-complete ternary Cayley graph that is a core with $3^3 = 27$ vertices?
By a ternary Cayley graph, I mean a (simple, undirected) graph whose vertex set is $\mathbb{Z}_3^n := \bigoplus_{i …
- 331
0
votes
Accepted
Is there a stiff graph that is not a core?
These answers is due to Wojowu and Anthony Quas respectively.
An infinite stiff graph that is not a core is a bi-infinite path, with vertex set $\mathbb{Z}$ and edge set $\{\{x, x+1\} \in \binom{\math …
0
votes
1
answer
79
views
Is there a stiff graph that is not a core?
By a graph, I mean a simple, undirected graph with no loops. A graph homomorphism $f : G \to H$ is a function from the vertexset of $G$ to the vertexset of $H$ such that if $u$ and $v$ are adjacent ve …
- 331