Related papers: Vertex decomposability, shellability and Cohen-Mac…
In recent decades, it has been emphasized that the evolving structure of networks may be shaped by interaction principles that yield sparse graphs with a vertex degree distribution exhibiting an algebraic tail, and other structural traits…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
We give necessary and sufficient conditions under which the Jacobian of a graph is generated by a divisor that is the difference of two vertices. This answers a question posed by Becker and Glass and allows us to prove various other…
For several important classes of manifolds acted on by the torus, the information about the action can be encoded combinatorially by a regular n-valent graph with vector labels on its edges, which we refer to as the torus graph. By analogy…
We investigate graphs that have characteristic-dependent well-covered dimension and show how more of these graphs can be constructed from known ones.
In this work we study a linear operator $f$ on a pre-euclidean space $\mathcal{V}$ by using properties of a corresponding graph. Given a basis $\B$ of $\mathcal{V}$, we present a decomposition of $\mathcal{V}$ as an orthogonal direct sum of…
The thickness $\theta(G)$ of a graph $G$ is the minimum number of planar spanning subgraphs into which the graph $G$ can be decomposed. As a topological invariant of a graph, it is a measurement of the closeness to planarity of a graph, and…
This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…
Ehrenborg, Govindaiah, Park, and Readdy recently introduced the van der Waerden complex, a pure simplicial complex whose facets correspond to arithmetic progressions. Using techniques from combinatorial commutative algebra, we classify when…
Many optimization, inference and learning tasks can be accomplished efficiently by means of decentralized processing algorithms where the network topology (i.e., the graph) plays a critical role in enabling the interactions among…
The first part of this paper, written mainly for nonspecialists, is a short and partial survey about the construction and classification of nilpotent Cohen-Macaulay scheme structures on a scheme "less nilpotent"(e.g. a smooth variety) as…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
A graph is $\ell$-choosable if, for any choice of lists of $\ell$ colors for each vertex, there is a list coloring, which is a coloring where each vertex receives a color from its list. We study complexity issues of choosability of graphs…
It is shown that there are infinitely many connected vertex-transitive graphs that have no Hamilton decomposition, including infinitely many Cayley graphs of valency 6, and including Cayley graphs of arbitrarily large valency.
We introduce and study strongly vertex dismissible, vertex dismissible, and scalable simplicial complexes as non-pure extensions of vertex decomposability and shellability. Strong vertex dismissibility is defined recursively by relaxing the…
The graph reconstruction conjecture asserts that every finite simple graph on at least three vertices can be reconstructed up to isomorphism from its deck - the collection of its vertex-deleted subgraphs. Kocay's Lemma is an important tool…
We study the Cohen-Macaulay property of triangular graphs $T_n$. We show that $T_2$, $T_3$ and $T_5$ are Cohen-Macaulay graphs, and that $T_4$, $T_6$, $T_8$ and $T_n$ are not Cohen-Macaulay graphs, for $n\geq 10$. Finally, we prove that…
The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the conjecture and present an…
This paper is a continuation of ``Operads, Grothendieck topologies and deformation theory'' (alg-geom/9502010). We show how to develop a cohomology theory that would control deformations of a sheaf of associative algebras over a scheme by…
The question of shellability of complexes of directed trees was asked by R. Stanley. D. Kozlov showed that the existence of a complete source in a directed graph provides a shelling of its complex of directed trees. We will show that this…