Timeline for Self-defining structures
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 4, 2011 at 9:32 | history | edited | Aaron Meyerowitz | CC BY-SA 2.5 |
added 321 characters in body
|
| Mar 4, 2011 at 8:36 | comment | added | Hans-Peter Stricker | I like $d(x) \neq d(y)$ better, because it's not a contradiction. But you are right, $d(x)d(y) \neq d(x)d(y)$ would also do the job. | |
| Mar 4, 2011 at 7:59 | comment | added | Aaron Meyerowitz | I just wasn't sure if $d(x) \ne d(y)$ really only caught edgeless graphs. And thought that $d(x) \ne d(x)$ did. | |
| Mar 4, 2011 at 7:13 | comment | added | Hans-Peter Stricker | As I pointed out in my question: it's $d(x) \neq d(y)$ that characterizes edgeless graphs, not $d(x) \neq d(x)$. | |
| Mar 4, 2011 at 3:18 | history | edited | Aaron Meyerowitz | CC BY-SA 2.5 |
added 425 characters in body
|
| Mar 4, 2011 at 3:01 | history | answered | Aaron Meyerowitz | CC BY-SA 2.5 |