====== Thomas Zaslavsky (Binghamton) ======

====== Mock Threshold Graphs: Planarity ======

===== Abstract for the Combinatorics Seminar 2016 March 1 =====

A mock threshold graph is a graph that wanted to be a threshold graph but (usually) didn't quite make it. (See [[abstract.201602siv|Vaidy Sivaraman's abstract]] for the definition.) I will show how the special properties of a mock threshold graph make it possible to give a complete structure theorem for those that can be embedded in the plane without self-intersections.

This is joint work with Richard Behr and Vaidy Sivaraman.


----