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"
Bookmarks inbookmarks:mine
inbookmarks:1234
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
Search options user 14167

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
1answer
Since about the time I asked the question, What is the precise relationship between "prodsimplicial sets" and rooted trees? I have been playing with these rooted trees and their correspondence to cert …
asked Sep 6 '12 by Spice the Bird
2
votes
Here I will sketch a proof, leaving many of the details out. The proof will be by induction on the number of edges of the rooted tree, which is the same as the dimension of the PS-complex (prod-simpli …
answered Nov 16 '12 by Spice the Bird
13
votes
5answers
Recall that rooted trees may be generated by starting with a trivial rooted tree (just a vertex), along with the operations of grafting a number of trees (identify their roots) and adding a new vertex …
asked Sep 22 '12 by Spice the Bird
3
votes
1answer
Let us first remark that all of this takes place on the boundary of $\Delta^n$. The question that I wanted to solve that led to the question in the title is as follows: Let $f:\Delta^{n-1}\hookrightar …
asked Jan 29 '12 by Spice the Bird