相关论文: A new graph invariant arises in toric topology

We define phylogenetic projective toric model of a trivalent graph as a generalization of a binary symmetric model of a trivalent phylogenetic tree. Generators of the pro- jective coordinate ring of the models of graphs with one cycle are…

This is an extended write-up of a talk given in April, 1993 in honor of Raoul Bott's 70th birthday. We first illustrate how some traditional topological and geometric invariants obey ``gluing laws'' inspired by those in classical and…

In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…

For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…

Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…

In this paper we introduce the concept of characteristic number that are proven to be useful in the study of the combinatorics of graph cohomology. We claim that it is a good combinatorial counterpart for geometric Betti numbers. We then…

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…

The paper consider an equivalence relation in the set of vertices of a bipartite graph. Some numerical characteristics showing the cardinality of equivalence classes are introduced. A combinatorial identity that is in relationship to these…

We study the analytic and topological invariants associated with complex normal surface singularities. Our goal is to provide topological formulae for several discrete analytic invariants whenever the analytic structure is generic (with…

Let $G$ be a finite simple graph on the vertex set $V(G)$ and let $r$ be a positive integer. We consider the hypergraph $\mathrm{Con}_r(G)$ whose vertices are the vertices of $G$ and the (hyper)edges are all $A\subseteq V(G)$ such that…

Independent sets play a key role into the study of graphs and important problems arising in graph theory reduce to them. We define the monomial ideal of independent sets associated to a finite simple graph and describe its homological and…

Let $\mathcal{D}$ be a weighted oriented graph and $I(\mathcal{D})$ be its edge ideal. In this paper, we investigate the Betti numbers of $I(\mathcal{D})$ via upper-Koszul simplicial complexes, Betti splittings and the mapping cone…

In this paper, motivated by a question posed in \cite{AH}, we introduce strongly biconvex graphs as a subclass of weakly chordal and bipartite graphs. We give a linear time algorithm to find an induced matching for such graphs and we prove…

We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…

The total Betti number of the independence complex of a graph is an intriguing graph invariant. Kalai and Meshulam have raised the question on its relation to cycles and the chromatic number of a graph, and a recent conjecture on that theme…

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…

The fundamental group of the complement of a hyperplane arrangement in a complex vector space is an important topological invariant. The third rank of successive quotients in the lower central series of the fundamental group was called Falk…

Given a vertex-weighted oriented graph, we can associate to it a set of monomials. We consider the toric ideal whose defining map is given by these monomials. We find a generating set for the toric ideal for certain classes of graphs which…

We show that Tim Cochran's invariants $\beta^i(L)$ of a $2$-component link $L$ in the $3$--sphere can be computed as intersection invariants of certain 2-complexes in the $4$--ball with boundary $L$. These 2-complexes are special types of…

In the standard category of directed graphs, graph morphisms map edges to edges. By allowing graph morphisms to map edges to finite paths (path homomorphisms of graphs), we obtain an ambient category in which we determine subcategories…