AbstractWe 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
A total dominating set in a graph is a set of vertices such that every vertex of the graph has a nei...
There are typically several nonisomorphic graphs having a given degree sequence, and for any two deg...
Abstract. We motivate and discuss four open problems in polyhedral combinatorics related to threshol...
Abstract. We consider a variety of connections between threshold graphs, shifted complexes, and simp...
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...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2003.Includes bibliogr...
The majorization relation orders the degree sequences of simple graphs into posets called dominance ...
AbstractWe deduce a set of known characterizations of threshold graphs (Theorem 3) from a set of cha...
AbstractIn this paper we consider threshold graphs (also called nested split graphs) and investigate...
AbstractA recent framework for generalizing the Erdős–Ko–Rado theorem, due to Holroyd, Spencer, and ...
The neighborhood complex N(G) is a simplicial complex assigned to a graph G whose connectivity gives...
AbstractThis paper deals with three generalizations of threshold graphs to hypergraphs proposed by M...
We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpl...
The majorization relation orders the degree sequences of simple graphs into posets called dominance ...
A total dominating set in a graph is a set of vertices such that every vertex of the graph has a nei...
There are typically several nonisomorphic graphs having a given degree sequence, and for any two deg...
Abstract. We motivate and discuss four open problems in polyhedral combinatorics related to threshol...
Abstract. We consider a variety of connections between threshold graphs, shifted complexes, and simp...
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...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2003.Includes bibliogr...
The majorization relation orders the degree sequences of simple graphs into posets called dominance ...
AbstractWe deduce a set of known characterizations of threshold graphs (Theorem 3) from a set of cha...
AbstractIn this paper we consider threshold graphs (also called nested split graphs) and investigate...
AbstractA recent framework for generalizing the Erdős–Ko–Rado theorem, due to Holroyd, Spencer, and ...
The neighborhood complex N(G) is a simplicial complex assigned to a graph G whose connectivity gives...
AbstractThis paper deals with three generalizations of threshold graphs to hypergraphs proposed by M...
We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpl...
The majorization relation orders the degree sequences of simple graphs into posets called dominance ...
A total dominating set in a graph is a set of vertices such that every vertex of the graph has a nei...
There are typically several nonisomorphic graphs having a given degree sequence, and for any two deg...
Abstract. We motivate and discuss four open problems in polyhedral combinatorics related to threshol...
DOI
Add to ORKG