Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count
Combinatorics
2015-09-25 v2
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.
Cite
@article{arxiv.1409.7133,
title = {Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count},
author = {Tristram C. Bogart and Edward D. Kim},
journal= {arXiv preprint arXiv:1409.7133},
year = {2015}
}
Comments
24 pages, 6 figures, to appear in Combinatorica