Related papers: Pseudograph and its associated real toric manifold
In \cite{4} Kauffman and Vogel constructed a rigid vertex regular isotopy invariant for unoriented four-valent graphs embedded in three dimensional space. It assigns to each embedded graph $G$ a polynomial, denoted $[G]$, in three…
We study a family $\mathcal{B}$ of pseudo-multipartite graphs indexed by staircase partitions. They are realised from the reduced words of certain class of permutations. We investigate the vertex proper colouring of these graphs and give…
In this paper, we investigate the induced subgraphs of percolated random geometric graphs, and get some asymptotic results for the expected number of the subgraphs. Moreover, we get the Poisson approximation for the counting by Stein's…
Associated to any graph is a toric ideal whose generators record relations among the cuts of the graph. We study these ideals and the geometry of the corresponding toric varieties. Our theorems and conjectures relate the combinatorial…
In this article we define an algebraic vertex of a generalized polyhedron and show that it is the smallest set of points needed to define the polyhedron. We prove that the indicator function of a generalized polytope $P$ is a linear…
Steinitz's theorem states that a graph $G$ is the edge-graph of a $3$-dimensional convex polyhedron if and only if, $G$ is simple, plane and $3$-connected. We prove an analogue of this theorem for ball polyhedra, that is, for intersections…
We explore pseudometrics for directed graphs in order to better understand their topological properties. The directed flag complex associated to a directed graph provides a useful bridge between network science and topology. Indeed, it has…
Graph polynomials are polynomials assigned to graphs. Interestingly, they also arise in many areas outside graph theory as well. Many properties of graph polynomials have been widely studied. In this paper, we survey some results on the…
The purpose of this article is to investigate the intersection cohomology for algebraic varieties with torus action. Given an algebraic torus $\mathbb{T}$, one of our result determines the intersection cohomology Betti numbers of any normal…
A \textit{geometric realization} of an abstract polyhedron $\mathcal{P}$ is a mapping $\rho : \mathcal{P} \to \mathbb{E}^3$ that sends an $i$-face to an open set of dimension $i$. This work adapts a method based on Wythoff construction to…
An abstract topological graph (briefly an AT-graph) is a pair $A=(G,\mathcal{X})$ where $G=(V,E)$ is a graph and $\mathcal{X}\subseteq {E \choose 2}$ is a set of pairs of its edges. The AT-graph $A$ is simply realizable if $G$ can be drawn…
We are concerned with split graphs and pseudo-split graphs whose complements are isomorphic to themselves. These special subclasses of self-complementary graphs are actually the core of self-complementary graphs. Indeed, we show that all…
We give two new constructions of the harmonic algebra of a lattice polytope $P$, a bigraded algebra whose character is the $q$-Ehrhart series of $P$ defined by Reiner and Rhoades. First, we show that the harmonic algebra is the associated…
Tensor models are used nowadays for implementing a fundamental theory of quantum gravity. We define here a polynomial $\mathcal T$ encoding the supplementary topological information. This polynomial is a natural generalization of the…
From the paper of the first author it follows that upper and lower bounds for $\gamma$-vector of a simple polytope imply the bounds for its $g$-,$h$- and $f$-vectors. In the paper of the second author it was obtained unimprovable upper and…
It is shown how a connected graph and a tree with partially prescribed spectrum can be constructed. These constructions are based on a recent result of Salez that every totally real algebraic integer is an eigenvalue of a tree. Our result…
In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…
We introduce a new operad-like structure that we call a reconnectad; the ``input'' of an element of a reconnectad is a finite simple graph, rather than a finite set, and ``compositions'' of elements are performed according to the notion of…
Let H be a graph, and let C_H(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C_H(G). Previous results cover only a few specific instances of this general…
Let H be a Tonelli Hamiltonian defined on the cotangent bundle of a compact and connected manifold and let u be a semi-concave function defined on M. If E (u) is the set of all the super-differentials of u and (\phi t) the Hamiltonian flow…