Polytope skeletons and paths

Gil Kalai

doi:10.1201/9781315119601

Polytope skeletons and paths

Gil Kalai^*

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

5 Scopus citations

Abstract

The k-dimensional skeleton of a d-polytope P is the set of all faces of the polytope of dimension at most k. The 1-skeleton of P is called the graph of P and denoted by G(P). G(P) can be regarded as an abstract graph whose vertices are the vertices of P, with two vertices adjacent if they form the endpoints of an edge of P.

Original language	English
Title of host publication	Handbook of Discrete and Computational Geometry, Third Edition
Publisher	CRC Press
Pages	505-532
Number of pages	28
ISBN (Electronic)	9781498711425
ISBN (Print)	9781498711395
DOIs	https://doi.org/10.1201/9781315119601
State	Published - 1 Jan 2017

Bibliographical note

Publisher Copyright:
© 2018 by Taylor & Francis Group, LLC.

Access to Document

10.1201/9781315119601

Cite this

@inbook{a8da5b5b1ae244d89718a84a16bb7555,

title = "Polytope skeletons and paths",

abstract = "The k-dimensional skeleton of a d-polytope P is the set of all faces of the polytope of dimension at most k. The 1-skeleton of P is called the graph of P and denoted by G(P). G(P) can be regarded as an abstract graph whose vertices are the vertices of P, with two vertices adjacent if they form the endpoints of an edge of P.",

author = "Gil Kalai",

note = "Publisher Copyright: {\textcopyright} 2018 by Taylor \& Francis Group, LLC.",

year = "2017",

month = jan,

day = "1",

doi = "10.1201/9781315119601",

language = "אנגלית",

isbn = "9781498711395",

pages = "505--532",

booktitle = "Handbook of Discrete and Computational Geometry, Third Edition",

publisher = "CRC Press",

}

TY - CHAP

T1 - Polytope skeletons and paths

AU - Kalai, Gil

PY - 2017/1/1

Y1 - 2017/1/1

N2 - The k-dimensional skeleton of a d-polytope P is the set of all faces of the polytope of dimension at most k. The 1-skeleton of P is called the graph of P and denoted by G(P). G(P) can be regarded as an abstract graph whose vertices are the vertices of P, with two vertices adjacent if they form the endpoints of an edge of P.

AB - The k-dimensional skeleton of a d-polytope P is the set of all faces of the polytope of dimension at most k. The 1-skeleton of P is called the graph of P and denoted by G(P). G(P) can be regarded as an abstract graph whose vertices are the vertices of P, with two vertices adjacent if they form the endpoints of an edge of P.

UR - https://www.scopus.com/pages/publications/85052706749

U2 - 10.1201/9781315119601

DO - 10.1201/9781315119601

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

AN - SCOPUS:85052706749

SN - 9781498711395

SP - 505

EP - 532

BT - Handbook of Discrete and Computational Geometry, Third Edition

PB - CRC Press

ER -

Polytope skeletons and paths

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint