# Convex Polytopes

```@inproceedings{Grunbaum1967ConvexP,
title={Convex Polytopes},
author={Branko Grunbaum and Geoffrey C. Shephard},
year={1967}
}```
• Published 1967
• Mathematics
Graphs, Graphs and Realizations Before proceeding to the graph version of Euler’s formula, some notation will be introduced. A (finite) abstract graph G consists of two sets, the set of vertices V = V(G) = {1, . . . , v} and the set of edges E = E(G) which consists of two-element subsets of V. If {u, w} is an edge, we write also uw for it and call w a neighbour of u and vice versa. If a vertex is contained in an edge or an edge contains a vertex then the vertex and the edge are incident. If two…
1,417 Citations
Eulerian edge refinements, geodesics, billiards and sphere coloring
This work constructs some ergodic billiards in 2-balls, where the geodesics bouncing off at the boundary symmetrically and which visit every interior edge exactly once, and tells that every 2-ball can be edge refined using interior edges to become Eulerian if and only if its boundary has length divisible by 3.
The Graph of the Hypersimplex
The (k,d)-hypersimplex is a (d-1)-dimensional polytope whose vertices are the (0,1)-vectors that sum to k. When k=1, we get a simplex whose graph is the complete graph with d vertices. Here we show
BARYCENTRIC CHARACTERISTIC NUMBERS
• Let
• Mathematics
• 2015
If G is the category of finite simple graphs G = (V,E), the linear space V of valuations on G has a basis given by the f-numbers vk(G) counting complete subgraphs Kk+1 in G. The barycentric
A Note on the Matching Polytope of a Graph
• Mathematics
TEMA (São Carlos)
• 2019
The matching polytope of a graph G, denoted by M(G), is the convex hull of the set of the incidence vectors of the matchings G. The graph  G(M(G)), whose vertices and edges are the vertices and edges
On Fredholm determinants in topology
It is proved that the Fredholm characteristic det(1+A) takes values in {-1,1} and is equal to the Fermi characteristic, which is the product of the w(x), where w( x)=(-1)^dim(x).
SOME HAMILTONIAN COUNTEREXAMPLES
In this article we survey some interesting examples and counterexamples concerning hamiltonian graphs and related concepts. The discussion is divided into three areas: necessary or sufficient
Orthogeodesic Point Set Embeddings of Outerplanar Graphs
Let G be a simple undirected n-vertex graph and let P ⊂ R be a general point set of size m, that is, a set of points where each two points have distinct xand distinct y-coordinates. We ask whether an
On the vertex degrees of the skeleton of the matching polytope of a graph
• Mathematics
• 2017
The convex hull of the set of the incidence vectors of the matchings of a graph G is the matching polytope of the graph, M(G). The graph whose vertices and edges are the vertices and edges of M(G) is