Timeline for out-trees and least upper boundness
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 19, 2011 at 16:22 | comment | added | Alon Amit | I'm still very confused. Yes, lattices contain semicycles, that's just the point - you were asking if every LUB graph is a (kind of) tree, and it isn't. You now changed the question to ask if every connected digraph without semicycles (which further satisfies LUB) must be a (kind of) tree. Well, it is, by definition, right? The underlying undirected graph certainly is a tree (connected and cycle free). This is just an out-tree except that we haven't chosen a specific root. | |
| Sep 18, 2011 at 22:39 | comment | added | adamo | Lattices contain semicycles. I've edited the question to clarify what he's asking a bit | |
| Sep 18, 2011 at 22:38 | vote | accept | adamo | ||
| Sep 18, 2011 at 22:38 | |||||
| Sep 15, 2011 at 9:05 | history | answered | Alon Amit | CC BY-SA 3.0 |