Timeline for When does a graph underlie the Hasse diagram of a poset?

7 events

when toggle format	what		by	license	comment
Apr 16 at 0:56	history	edited	David Roberts♦	CC BY-SA 4.0	Wayback machine link for stability
Oct 2, 2019 at 15:53	history	edited	Sam Hopkins	CC BY-SA 4.0	added 218 characters in body
Oct 2, 2019 at 15:45	comment	added	Russ Woodroofe		Ok, right. Perhaps one of you wants to edit the post to reflect? (and I'd delete the answer) Or I could edit the answer... It seems like something someone else might get caught by.
Oct 2, 2019 at 15:42	comment	added	Sam Hopkins		Indeed, comparability graphs are characterizable in a simple way, whereas Hasse diagrams seem much more complicated.
Oct 2, 2019 at 15:41	history	edited	Russ Woodroofe	CC BY-SA 4.0	add some refs
Oct 2, 2019 at 15:40	comment	added	Ethan Splaver		These are not comparability graphs. Those refer to the undirected edges of the poset itself not the undirected edges of its Hasse diagram. For the poset $\small P=(X,\leq)$ the comparability graph would be $\small H=(X,\{\{u,v\}:u<v\})$ however I am interested in the graph $\small G=(X,\{\{u,v\}:u\lessdot v\})$.
Oct 2, 2019 at 15:37	history	answered	Russ Woodroofe	CC BY-SA 4.0