Corpus ID: 119249576

Reconstructing Nearly Simple Polytopes from their Graph

@article{Doolittle2017ReconstructingNS,
  title={Reconstructing Nearly Simple Polytopes from their Graph},
  author={Joseph Doolittle},
  journal={arXiv: Combinatorics},
  year={2017}
}
  • Joseph Doolittle
  • Published 2017
  • Mathematics
  • arXiv: Combinatorics
  • We present a partial description of which polytopes are reconstructible from their graphs. This is an extension of work by Blind and Mani (1987) and Kalai (1988), which showed that simple polytopes can be reconstructed from their graphs. In particular, we introduce a notion of $h$-nearly simple and prove that 1-nearly simple and 2-nearly simple polytopes are reconstructible from their graphs. We also give an example of a 3-nearly simple polytope which is not reconstructible from its graph… CONTINUE READING
    2 Citations
    On the Reconstruction of Polytopes
    • 5
    • PDF
    Polytopes Close to Being Simple
    • 3
    • Highly Influenced
    • PDF

    References

    SHOWING 1-6 OF 6 REFERENCES
    Finding a Simple Polytope from Its Graph in Polynomial Time
    • E. Friedman
    • Mathematics, Computer Science
    • Discret. Comput. Geom.
    • 2009
    • 18
    • PDF
    On thek-systems of a simple polytope
    • 19
    • PDF
    Examples and Counterexamples for the Perles Conjecture
    • 12
    • Highly Influential
    • PDF
    A simple way to tell a simple polytope from its graph
    • G. Kalai
    • Mathematics, Computer Science
    • J. Comb. Theory, Ser. A
    • 1988
    • 103
    • Highly Influential
    • PDF
    Puzzles and polytope isomorphisms
    • 80
    • Highly Influential
    Classification of Oriented Matroids, 2016
    • (accessed December
    • 2016