Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple graphs. In the present paper we highlight their connections to the Kuramoto synchronization model in physics — where they are called adjacency polytopes — and to Kantorovich-Rubinstein polytopes from finite metric space theory. Each of these connections motivates the study of symmetric edge polytopes of particular classes of graphs. We focus on such classes and apply algebraic combinatorial methods to investigate invariants of the associated symmetric edge polytopes.publishe
We consider families of symmetric linear programs (LPs) that decide a property of graphs (or other r...
There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper...
Poset associahedra are a family of convex polytopes recently introduced by Pavel Galashin in 2021. T...
Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple graphs. In ...
Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simpl...
Symmetric edge polytopes \(\mathcal{A}_G\) of type A are lattice polytopes arising from the root sys...
A spectral graph realization is an embedding of a finite simple graph into Euclidean space that is c...
The last 15 years have seen a significant progress in the development of general purpose algorithms ...
AbstractThe paper describes a construction of abstract polytopes from Cayley graphs of symmetric gro...
Previously we have investigated the medial layer graph G for a finite, self-dual, regular or chiral ...
In this paper we study enumeration problems for polytopes arising from combinatorial optimization pr...
The history of graphs goes back to the work of Eulerin his discovery of the equation f – e + v = ...
. We study the combinatorial structure of the cut and metric polytopes on n nodes for n 5. Those t...
. A plane graph is called symmetric if it is invariant under the reflection across some straight lin...
This thesis is concerned with perfect matchings of graphs and is organized in three parts. In the fi...
We consider families of symmetric linear programs (LPs) that decide a property of graphs (or other r...
There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper...
Poset associahedra are a family of convex polytopes recently introduced by Pavel Galashin in 2021. T...
Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple graphs. In ...
Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simpl...
Symmetric edge polytopes \(\mathcal{A}_G\) of type A are lattice polytopes arising from the root sys...
A spectral graph realization is an embedding of a finite simple graph into Euclidean space that is c...
The last 15 years have seen a significant progress in the development of general purpose algorithms ...
AbstractThe paper describes a construction of abstract polytopes from Cayley graphs of symmetric gro...
Previously we have investigated the medial layer graph G for a finite, self-dual, regular or chiral ...
In this paper we study enumeration problems for polytopes arising from combinatorial optimization pr...
The history of graphs goes back to the work of Eulerin his discovery of the equation f – e + v = ...
. We study the combinatorial structure of the cut and metric polytopes on n nodes for n 5. Those t...
. A plane graph is called symmetric if it is invariant under the reflection across some straight lin...
This thesis is concerned with perfect matchings of graphs and is organized in three parts. In the fi...
We consider families of symmetric linear programs (LPs) that decide a property of graphs (or other r...
There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper...
Poset associahedra are a family of convex polytopes recently introduced by Pavel Galashin in 2021. T...