Superlinear subset partition graphs with dimension reduction, strong   adjacency, and endpoint count
  We construct a sequence of subset partition graphs satisfying the dimension reduction, adjacency, strong adjacency, and endpoint count properties whose diameter has a superlinear asymptotic lower bound. These abstractions of polytope graphs give further evidence against the Linear Hirsch Conjecture. 
Tristram C. Bogart, Edward D. Kim
math.CO