Constructing subset partition graphs with strong adjacency and end-point count properties

Nicolai Hähnle

Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be…