Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Mathematics > Combinatorics

arXiv:1409.7133 (math)
[Submitted on 25 Sep 2014 (v1), last revised 23 Sep 2015 (this version, v2)]

Title:Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count

Authors:Tristram C. Bogart, Edward D. Kim
View PDF
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.
Comments: 24 pages, 6 figures, to appear in Combinatorica
Subjects: Combinatorics (math.CO)
MSC classes: 05B40, 05C12, 52B05, 90C05
Cite as: arXiv:1409.7133 [math.CO]
  (or arXiv:1409.7133v2 [math.CO] for this version)
  https://doi.org/10.48550/arXiv.1409.7133

Submission history

From: Edward Kim [view email]
[v1] Thu, 25 Sep 2014 01:03:57 UTC (28 KB)
[v2] Wed, 23 Sep 2015 20:26:34 UTC (29 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
math.CO
< prev   |   next >
new | recent | 2014-09
Change to browse by:
math

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)