Related papers: Magic graphs and the faces of the Birkhoff polytop…
The paper extends Birkhoff's theorem on doubly stochastic matrices to some countable families of discrete probability spaces with nonempty intersections. We join every two elements lying in the same probability space by an edge and…
In this paper we define a pair of faithful functors that map isomorphic and isotopic finite-dimensional algebras over finite fields to isomorphic graphs. These functors reduce the cost of computation that is usually required to determine…
Self-polar polytopes are convex polytopes that are equal to an orthogonal transformation of their polar sets. These polytopes were first studied by Lov\'{a}sz as a means of establishing the chromatic number of distance graphs on spheres,…
In [Baumeister, H., Nill, Paffenholz, On permutation polytopes, Adv. Math. 222 (2009), 431-452 / arXiv:0709.1615] we conjectured a characterization of subgroups H of a permutation group G so that, on the level of permutation polytopes, P(H)…
We compute the set of facets of the polytope which is the convex hull of the Coxeter groups $\mathsf{F}_4$ or $\mathsf{H}_4$: For the group $\mathsf{F}_4$ we found $2$ orbits of facets which contradicts previous results published in…
Beck et. al. characterized the grid graphs whose perfect matching polytopes are Gorenstein and they also showed that for some parameters, perfect matching polytopes of torus graphs are Gorenstein. In this paper, we complement their result,…
A graph labeling assigns values to the components of a graph (vertices, edges, etc.). In particular, distance magic labelings have been widely studied in undirected graphs. In such a labeling, the vertices are labeled with unique values…
A $3$-polytope is a $3$-connected, planar graph. It is called unigraphic if it does not share its vertex degree sequence with any other $3$-polytope, up to graph isomorphism. The classification of unigraphic $3$-polytopes appears to be a…
We give a new definition of lattice-face polytopes by removing an unnecessary restriction in the paper "Ehrhart polynomials of lattice-face polytopes", and show that with the new definition, the Ehrhart polynomial of a lattice-face polytope…
A subset $S$ of vertices of a graph $G$ is called a perfectly matchable set of $G$ if the subgraph induced by $S$ contains a perfect matching. The perfectly matchable set polynomial of $G$, first made explicit by Ohsugi and Tsuchiya, is the…
Bisztriczky defines a multiplex as a generalization of a simplex, and an ordinary polytope as a generalization of a cyclic polytope. This paper presents results concerning the combinatorics of multiplexes and ordinary polytopes. The flag…
The connectivity of graphs of simplicial and polytopal complexes is a classical subject going back at least to Steinitz, and the topic has since been studied by many authors, including Balinski, Barnette, Athanasiadis and Bjorner. In this…
For Hamiltonian circle actions on compact, connected, four-dimensional manifolds, we give a generators and relations description for the even part of the equivariant cohomology, as an algebra over the equivariant cohomology of a point. This…
Motivated by the concept of well-covered graphs, we define a graph to be well-bicovered if every vertex-maximal bipartite subgraph has the same order (which we call the bipartite number). We first give examples of them, compare them with…
A graph is distance magic if it admits a bijective labeling of its vertices by integers from $1$ up to the order of the graph in such a way that the sum of the labels of all the neighbors of a vertex is independent of a given vertex. We…
The Ehrhart ring of the edge polytope $\mathcal{P}_G$ for a connected simple graph $G$ is known to coincide with the edge ring of the same graph if $G$ satisfies the odd cycle condition. This paper gives for a graph which does not satisfy…
The super edge-magicness of graphs of equal order and size has been shown to be important since such graphs can be used as seeds to answer many questions related to (super) edge-magic labelings and other types of well studied labelings, as…
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…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
For real application and theoretical investigation of ordinary hypergraphs and non-ordinary hypergraphs, researchers need to establish standard rules and feasible operating methods. We propose a visualization tool for investigating…