Add to ORKGAbstract. We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the independent set, neighborhood, and dominance complexes. We present a number of structural results and relations among them including new characterizations of the class of threshold graphs. 1
Abstract. A graphG = (V, E) is a threshold tolerance if it is possible to associate weights and tole...
AbstractThe critical group of a connected graph is a finite abelian group, whose order is the number...
Lovász's striking proof of Kneser's conjecture from 1978 using the Borsuk–Ulam theorem provides a lo...
AbstractWe consider a variety of connections between threshold graphs, shifted complexes, and simpli...
article published in a peer reviewed, open access journal.The goal of this paper is to introduce a n...
Abstract. We motivate and discuss four open problems in polyhedral combinatorics related to threshol...
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up...
AbstractWe study the structure of the networks in which connectedness and disconnectedness can be ex...
AbstractThis paper deals with three generalizations of threshold graphs to hypergraphs proposed by M...
The neighborhood complex N(G) is a simplicial complex assigned to a graph G whose connectivity gives...
AbstractWe deduce a set of known characterizations of threshold graphs (Theorem 3) from a set of cha...
Let G be a finite graph with vertex set V and edge set E. A graph complex on G is an abstract simpli...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2003.Includes bibliogr...
We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpl...
There are typically several nonisomorphic graphs having a given degree sequence, and for any two deg...
Abstract. A graphG = (V, E) is a threshold tolerance if it is possible to associate weights and tole...
AbstractThe critical group of a connected graph is a finite abelian group, whose order is the number...
Lovász's striking proof of Kneser's conjecture from 1978 using the Borsuk–Ulam theorem provides a lo...
AbstractWe consider a variety of connections between threshold graphs, shifted complexes, and simpli...
article published in a peer reviewed, open access journal.The goal of this paper is to introduce a n...
Abstract. We motivate and discuss four open problems in polyhedral combinatorics related to threshol...
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up...
AbstractWe study the structure of the networks in which connectedness and disconnectedness can be ex...
AbstractThis paper deals with three generalizations of threshold graphs to hypergraphs proposed by M...
The neighborhood complex N(G) is a simplicial complex assigned to a graph G whose connectivity gives...
AbstractWe deduce a set of known characterizations of threshold graphs (Theorem 3) from a set of cha...
Let G be a finite graph with vertex set V and edge set E. A graph complex on G is an abstract simpli...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2003.Includes bibliogr...
We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpl...
There are typically several nonisomorphic graphs having a given degree sequence, and for any two deg...
Abstract. A graphG = (V, E) is a threshold tolerance if it is possible to associate weights and tole...
AbstractThe critical group of a connected graph is a finite abelian group, whose order is the number...
Lovász's striking proof of Kneser's conjecture from 1978 using the Borsuk–Ulam theorem provides a lo...