AbstractThis paper deals with three generalizations of threshold graphs to hypergraphs proposed by M. Ch. Golumbic. Answering a question of M. Ch. Golumbic we show that these three definitions are not equivalent. The main results of the paper are Theorems 2.5 and 2.6 which characterize hypergraphs satisfying the most general of above definitions
This thesis consists of four parts, each regarding a topic from extremal combinatorics. While only C...
We define a weakly threshold sequence to be a degree sequence$d=(d_1,\dots,d_n)$ of a graph having t...
AbstractThe problem of determining whether a graph G contains a threshold subgraph containing at lea...
AbstractThis paper deals with three generalizations of threshold graphs to hypergraphs proposed by M...
Abstract. We motivate and discuss four open problems in polyhedral combinatorics related to threshol...
AbstractWe deduce a set of known characterizations of threshold graphs (Theorem 3) from a set of cha...
Abstract. A graphG = (V, E) is a threshold tolerance if it is possible to associate weights and tole...
A total dominating set in a graph is a set of vertices such that every vertex of the graph has a nei...
Abstract. We study the limit theory of large threshold graphs and apply this to a variety of models ...
It is shown that every non-trivial monotone increasing property of subsets of a set has a threshold ...
Abstract. We consider a variety of connections between threshold graphs, shifted complexes, and simp...
Let F be a family of r-uniform hypergraphs. The chromatic threshold of F is the infimum of all non-n...
The recognition of threshold graphs, those graphs with threshold dimension one, is well understood a...
AbstractA graph is said to be threshold if there exist real numbers ai associated with its vertices ...
AbstractWe consider a variety of connections between threshold graphs, shifted complexes, and simpli...
This thesis consists of four parts, each regarding a topic from extremal combinatorics. While only C...
We define a weakly threshold sequence to be a degree sequence$d=(d_1,\dots,d_n)$ of a graph having t...
AbstractThe problem of determining whether a graph G contains a threshold subgraph containing at lea...
AbstractThis paper deals with three generalizations of threshold graphs to hypergraphs proposed by M...
Abstract. We motivate and discuss four open problems in polyhedral combinatorics related to threshol...
AbstractWe deduce a set of known characterizations of threshold graphs (Theorem 3) from a set of cha...
Abstract. A graphG = (V, E) is a threshold tolerance if it is possible to associate weights and tole...
A total dominating set in a graph is a set of vertices such that every vertex of the graph has a nei...
Abstract. We study the limit theory of large threshold graphs and apply this to a variety of models ...
It is shown that every non-trivial monotone increasing property of subsets of a set has a threshold ...
Abstract. We consider a variety of connections between threshold graphs, shifted complexes, and simp...
Let F be a family of r-uniform hypergraphs. The chromatic threshold of F is the infimum of all non-n...
The recognition of threshold graphs, those graphs with threshold dimension one, is well understood a...
AbstractA graph is said to be threshold if there exist real numbers ai associated with its vertices ...
AbstractWe consider a variety of connections between threshold graphs, shifted complexes, and simpli...
This thesis consists of four parts, each regarding a topic from extremal combinatorics. While only C...
We define a weakly threshold sequence to be a degree sequence$d=(d_1,\dots,d_n)$ of a graph having t...
AbstractThe problem of determining whether a graph G contains a threshold subgraph containing at lea...
DOI
Add to ORKG