Timeline for Functions and graphs
Current License: CC BY-SA 2.5
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 6, 2010 at 14:30 | answer | added | Joel David Hamkins | timeline score: 1 | |
| Jun 6, 2010 at 8:18 | comment | added | Martin Rubey | Your point is that you want to have unlabelled digraphs, right? So the object node x has two parallel arcs to the argument node (x,x)? I think you need to require n such parallel arcs with different targets, otherwise it seems to me that bipartness does not suffice to make the graph be a functional graph. (An example, forgetting about the functional values: consider n=3, and the disjoint union of a K_{2,4} and a digraph on three nodes, one of which has outdegree 4, the other 2 having each indegree 2) | |
| Jun 6, 2010 at 1:52 | history | edited | Hans-Peter Stricker | CC BY-SA 2.5 |
edited title; edited title
|
| Jun 6, 2010 at 1:39 | history | asked | Hans-Peter Stricker | CC BY-SA 2.5 |