2000 character limit reached
Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count (1409.7133v2)
Published 25 Sep 2014 in math.CO
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.