Planar Graphs and Planar Posets II

Series: 
Graph Theory Seminar
Thursday, September 3, 2009 - 12:05
1.5 hours (actually 80 minutes)
Location: 
Skiles 255
,  
School of Mathematics, Georgia Tech
Organizer: 
We will discuss the classic theorem of Walter Schnyder: a graph G is planar if and only if the dimension of its incidence poset is at most 3. This result has been extended by Brightwell and Trotter to show that the dimension of the vertex-edge-face poset of a planar 3-connected graph is 4 and the removal of any vertex (or by duality, any face) reduces the dimension to 3. Recently, this result and its extension to planar multigraphs was key to resolving the question of the dimension of the adjacency poset of a planar bipartite graph. It also serves to motivate questions about the dimension of posets with planar cover graphs.