相关论文: Reconstructing a Simple Polytope from its Graph

Graph polytopes arising from vertex-weighted graphs were first introduced by B\'ona, Ju, and Yoshida. We prove a conjecture stating that for any simple connected graph, the numerator polynomial of the Ehrhart series of its graph polytope is…

A point visibility graph is a graph induced by a set of points in the plane, where every vertex corresponds to a point, and two vertices are adjacent whenever the two corresponding points are visible from each other, that is, the open…

We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…

How much of the combinatorial structure of a pointed polyhedron is contained in its vertex-facet incidences? Not too much, in general, as we demonstrate by examples. However, one can tell from the incidence data whether the polyhedron is…

The visibility graph of a simple polygon represents visibility relations between its vertices. Knowing the correct order of the vertices around the boundary of a polygon and its visibility graph, it is an open problem to locate the vertices…

We introduce and study the problem of optimizing arbitrary functions over degree sequences of hypergraphs and multihypergraphs. We show that over multihypergraphs the problem can be solved in polynomial time. For hypergraphs, we show that…

Given a graph G, an incidence matrix N(G) is defined for the set of distinct isomorphism types of induced subgraphs of G. If Ulam's conjecture is true, then every graph invariant must be reconstructible from this matrix, even when the…

Every generic linear functional $f$ on a convex polytope $P$ induces an orientation on the graph of $P$. From the resulting directed graph one can define a notion of $f$-arborescence and $f$-monotone path on $P$, as well as a natural graph…

The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the conjecture and present an…

We investigate some combinatorial properties of convex polytopes simple in edges. For polytopes whose nonsimple vertices are located sufficiently far one from another, we prove an analog of the Hard Lefschetz theorem. It implies Stanley's…

The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…

This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

We introduce fractional realizations of a graph degree sequence and a closely associated convex polytope. Simple graph realizations correspond to a subset of the vertices of this polytope. We describe properties of the polytope vertices and…

Starting from a finite simple graph $G$, for each eigenvalue $\theta$ of its adjacency matrix one can construct a convex polytope $P_G(\theta)$, the so called $\theta$-eigenpolytop of $G$. For some polytopes this technique can be used to…

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…

We identify a family of $O(|E(G)|^2)$ nontrivial facets of the connected matching polytope of a graph $G$, that is, the convex hull of incidence vectors of matchings in $G$ whose covered vertices induce a connected subgraph. Accompanying…

The cut polytope of a graph arises in many fields. Although much is known about facets of the cut polytope of the complete graph, very little is known for general graphs. The study of Bell inequalities in quantum information science…

The convex hulls of face-vertex incident vectors of 3-face-colorable convex polytopes are computed. It is found that every such convex hull is a $d$-polytope with $d+2$ or $d+3$ vertices. Utilizing Gale transform and Gale diagram, we…