Related papers: Independence complexes of circle graphs

We give a probabilistic construction of a $3$-uniform hypergraph on $N$ vertices with independence number $O(\log N / \log \log N)$ in which there are at most two edges among any four vertices. This bound is tight and solves a longstanding…

Let $G=(V,E)$ be a finite simple graph. In this paper, we study the degree of the $h$-polynomial of the edge ideal of $G$ in relation to the independence number of $G$. Our approach is based on the value of the independence polynomial of…

An independent set in a graph G is a set of vertices no two of which are joined by an edge. A vertex-weighted graph associates a weight with every vertex in the graph. A vertex-weighted graph G is called a unique independence…

Recently, Zhang and Wu proved a conjecture of Kalai and Meshulam, showing that for every graph $G$ without induced cycles of length divisible by $3$, the sum of all reduced Betti numbers of its independence complex $I(G)$ is at most $1$. We…

Graph independence (also known as $\epsilon$-independence or $\lambda$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and operator algebras. Using conjugation by certain…

We study the topological persistence of the (path) configuration spaces and the (path) independence complexes for digraphs as well as their underlying graphs. We construct some canonical embeddings from the (path) independence complexes of…

We utilize relations between Khovanov and chromatic graph homology to determine extreme Khovanov groups and corresponding coefficients of the Jones polynomial. The extent to which chromatic homology and chromatic polynomial can be used to…

Given finite simple graphs $G$ and $H$, the Hom complex $\mathrm{Hom}(G,H)$ is a polyhedral complex having the graph homomorphisms $G\to H$ as the vertices. We determine the homotopy type of each connected component of $\mathrm{Hom}(G,H)$…

We discuss the topological properties of the independence complex of Kneser graphs, Ind(KG$(n, k))$, with $n\geq 3$ and $k\geq 1$. By identifying one kind of maximal simplices through projective planes, we obtain homology generators for the…

We study the behaviour of clique complexes of graphs under the operation of taking graph powers. As an example we compute the clique complexes of powers of cycles, or, in other words, the independence complexes of circular complete graphs.

The combinatorial properties of double vertex graphs has been widely studied since the 90's. However only very few results are know about the independence number of such graphs. In this paper we obtain the independence numbers of the double…

We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…

Bipartite graphs are a fundamental concept in graph theory with diverse applications. A graph is bipartite iff it contains no odd cycles, a characteristic that has many implications in diverse fields ranging from matching problems to the…

The graph polynomial for the number of independent sets of size $k$ in a general undirected graph is shown to be equal to an elementary symmetric polynomial of the vertex monomials, which are determined by the edges incident at the…

By considering a version of Khovanov homology incorporating both the Lee and $E(-1)$ differentials, we construct a $1$-parameter family of concordance homomorphisms similar to the Upsilon invariant from knot Floer homology. This invariant…

We show that the dominance complex $\mathcal{D}(G)$ of a graph $G$ coincides with the combinatorial Alexander dual of the neighborhood complex $\mathcal{N}(\overline{G})$ of the complement of $G$. Using this, we obtain a relation between…

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…

We characterize unicyclic graphs that are singular using the support of the null space of their pendant trees. From this, we obtain closed formulas for the independence and matching numbers of a unicyclic graph, based on the support of its…

The theory of complexes of directed trees was initiated by Kozlov to answer a question by Stanley, and later on, results from the theory were used by Babson and Kozlov in their proof of the Lovasz conjecture. We develop the theory and prove…

Inspired by several recent papers on the edge ideal of a graph G, we study the equivalent notion of the independence complex of G. Using the tool of vertex decomposability from geometric combinatorics, we show that 5-chordal graphs with no…