Timeline for Reconstruction Conjecture holds for Directed Acyclic Graphs?
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 19, 2014 at 10:22 | comment | added | Dag Oskar Madsen | @QiaochuYuan: A deck is just a multiset. If the Deck Reconstruction Conjecture is equivalent to the Set Reconstruction Conjecture I think still is an open question. | |
| Dec 19, 2014 at 10:12 | comment | added | Qiaochu Yuan | Is there an additional meaning to the use of the word "deck" here that isn't carried by "set" (or maybe "multiset")? | |
| Dec 19, 2014 at 9:55 | history | edited | Dag Oskar Madsen |
added *graph-reconstruction* tag
|
|
| Aug 28, 2012 at 6:28 | comment | added | Dag Oskar Madsen | The poset problem translated to the path algebra situation becomes the question whether $\Lambda$ is reconstructible from the deck of subalgebras $(1-e)\Lambda (1-e)$, where $e$ runs over all the trivial paths. | |
| Aug 27, 2012 at 23:35 | comment | added | Richard Stanley | A related question is the reconstruction of posets. See for instance springerlink.com/content/q10314j8j0j721l8. | |
| Aug 27, 2012 at 16:21 | history | edited | Dag Oskar Madsen | CC BY-SA 3.0 |
added 1 characters in body
|
| Aug 27, 2012 at 13:02 | history | edited | Dag Oskar Madsen | CC BY-SA 3.0 |
added 30 characters in body
|
| Aug 27, 2012 at 12:43 | history | edited | Dag Oskar Madsen | CC BY-SA 3.0 |
added 1 characters in body
|
| Aug 27, 2012 at 11:48 | answer | added | Julian Kuelshammer | timeline score: 1 | |
| Aug 27, 2012 at 10:18 | comment | added | Brendan McKay | Nice question. There are actually two questions here, depending in whether the acyclicity is given or has to be inferred from the deck, but that is not an issue: for $n\ge 3$, $G$ is acyclic iff every vertex-deleted subgraph is acyclic and not all of them are paths. | |
| Aug 27, 2012 at 10:03 | history | asked | Dag Oskar Madsen | CC BY-SA 3.0 |