Related papers: Polytopality of Maniplexes
Given a graph property $\mathcal{P}$, it is interesting to determine the typical structure of graphs that satisfy $\mathcal{P}$. In this paper, we consider monotone properties, that is, properties that are closed under taking subgraphs.…
It is well known that a three dimensional (closed, connected and compact) manifold is obtained by identifying boundary faces from a polyhedron P. The study of (\partial P)/~, the boundary \partial P with the polygonal faces identified in…
Let $P$ be a set of $n \geq 5$ points in convex position in the plane. The path graph $G(P)$ of $P$ is an abstract graph whose vertices are non-crossing spanning paths of $P$, such that two paths are adjacent if one can be obtained from the…
We present a discrete Morse-theoretic method for proving that a regular CW complex is homeomorphic to a sphere. We use this method to define bisimplices, the cells of a class of regular CW complexes we call bisimplicial complexes. The…
A simple graph $G$ with maximum degree $\Delta$ is \emph{overfull} if $|E(G)|>\Delta \lfloor |V(G)|/2\rfloor$. The \emph{core} of $G$, denoted $G_{\Delta}$, is the subgraph of $G$ induced by its vertices of degree $\Delta$. Clearly, the…
The symmetric edge polytope ($\mathrm{SEP}$) of a finite simple graph $G$ is a centrally symmetric lattice polytope whose vertices are defined by the edges of the graph. Among the information encoded by these polytopes are the symmetries of…
Chemical graphs are simple undirected connected graphs, where vertices represent atoms in a molecule and edges represent chemical bonds. A degree-based topological index is a molecular descriptor used to study specific physicochemical…
For a locally finite, connected graph $\Gamma$, let $\operatorname{Map}(\Gamma)$ denote the group of proper homotopy equivalences of $\Gamma$ up to proper homotopy. Excluding sporadic cases, we show $\operatorname{Aut}(S(M_\Gamma)) \cong…
Blind and Mani (1987) proved that the entire combinatorial structure (the vertex-facet incidences) of a simple convex polytope is determined by its abstract graph. Their proof is not constructive. Kalai (1988) found a short, elegant, and…
We study the isotropy representation of real flag manifolds associated to simple Lie algebras that are split real forms of complex simple Lie algebras. For each Dynkin diagram the invariant irreducible subspaces for the compact part of the…
We prove that the graph of a continuous function $f$, defined on a domain of ${\mathbb C}^n$, is pluripolar if and only if $f$ is holomorphic.
We study the complexity of the Graph Isomorphism problem on graph classes that are characterized by a finite number of forbidden induced subgraphs, focusing mostly on the case of two forbidden subgraphs. We show hardness results and develop…
A geometric graph is a simple graph G together with a straight line drawing of G in the plane with the vertices in general position. Two geometric realizations of a simple graph are geo-isomorphic if there is a vertex bijection between them…
Each rule $f$ that assigns a vector $f(G)$ to an $(n+1)$-graph $G$ determines a class (or property) of $n$-manifold invariants. An invariant $v=v(M)$ is in this class if, for any triangulated manifold $|G|=M$, one has that $v(M)$ is a…
In this paper we show that graphs of "neighbourly" cubical complexes -- cubical complexes in which every pair of vertices spans a (unique) cube -- have good expansion properties, using a technique based on multicommodity flows. By showing…
An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…
This note defines a flag vector for $i$-graphs. The construction applies to any finite combinatorial object that can be shelled. Two possible connections to quantum topology are mentioned. Further details appear in the author's "On quantum…
The aim of this paper is to classify all invariant generalized complex structure on a partial flag manifold $\mathbb{F}_\Theta$ with at most four isotropy summands. To classify them all we proved that an invariant generalized almost complex…
For an integer $m\geq 1$, a combinatorial manifold $\widetilde{M}$ is defined to be a geometrical object $\widetilde{M}$ such that for $\forall p\in\widetilde{M}$, there is a local chart $(U_p,\phi_p)$ enable $\phi_p:U_p\to…
A $0/1$-polytope in $\mathbb{R}^n$ is the convex hull of a subset of $\{0,1\}^n$. The graph of a polytope $P$ is the graph whose vertices are the zero-dimensional faces of $P$ and whose edges are the one-dimensional faces of $P$. A…