Timeline for Posets as graphs with the direct neighbor relation
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 12, 2017 at 6:17 | vote | accept | Dominic van der Zypen | ||
| Oct 11, 2017 at 15:24 | answer | added | John Machacek | timeline score: 3 | |
| Oct 11, 2017 at 14:50 | comment | added | Peter Taylor | It can contain an odd cycle. Consider a poset which is fully characterised by two chains: $a < b < c$ and $a < d < e < c$. Then $(P, E_P)$ is a single cycle of length 5. | |
| Oct 11, 2017 at 14:36 | history | edited | Dominic van der Zypen | CC BY-SA 3.0 |
added 96 characters in body
|
| Oct 11, 2017 at 14:35 | comment | added | Dominic van der Zypen | Right @PeterTaylor - it can't...! If it cannot contain an odd cycle, then the answer is clear. Sorry for my mistake | |
| Oct 11, 2017 at 14:16 | comment | added | Peter Taylor | Your "direct neighbour graph" looks like the transitive reduction, but I'm not sure how it could contain a 3-clique. | |
| Oct 11, 2017 at 14:05 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |