AbstractWe deduce a set of known characterizations of threshold graphs (Theorem 3) from a set of characterizations of Ferrers digraphs (Theorem 1) by investigating the connection between symmetric Ferrers digraphs and threshold graphs. A direct proof of Theorem 3 is easier than the one provided in here, but the purpose of this paper is to view Theorem 1 as an extension of Theorem 3 to the directed case (this extension point of view still holds on an algorithmic ground)
A graph G on n vertices is a threshold graph if there exist real numbers $$a:1,a_2, \ldots, a_n$$ an...
Abstract. A graphG = (V, E) is a threshold tolerance if it is possible to associate weights and tole...
AbstractA graph G is called a strict 2-threshold graph if its edge-set can be partitioned into two t...
AbstractWe deduce a set of known characterizations of threshold graphs (Theorem 3) from a set of cha...
A digraph whose degree sequence has a unique vertex labeled realization is called threshold. In this...
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...
We look at the recently developed concept of graphons first discussed by Lovász and Szegedy in 2004....
It is shown that every non-trivial monotone increasing property of subsets of a set has a threshold ...
We define a class of bipartite graphs that correspond naturally with Ferrers diagrams. We give expre...
Abstract. We consider a variety of connections between threshold graphs, shifted complexes, and simp...
A total dominating set in a graph is a set of vertices such that every vertex of the graph has a nei...
AbstractWe consider a variety of connections between threshold graphs, shifted complexes, and simpli...
Abstract. We consider the following fundamental realization problem of directed graphs. Given a sequ...
The recognition of threshold graphs, those graphs with threshold dimension one, is well understood a...
A graph G on n vertices is a threshold graph if there exist real numbers $$a:1,a_2, \ldots, a_n$$ an...
Abstract. A graphG = (V, E) is a threshold tolerance if it is possible to associate weights and tole...
AbstractA graph G is called a strict 2-threshold graph if its edge-set can be partitioned into two t...
AbstractWe deduce a set of known characterizations of threshold graphs (Theorem 3) from a set of cha...
A digraph whose degree sequence has a unique vertex labeled realization is called threshold. In this...
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...
We look at the recently developed concept of graphons first discussed by Lovász and Szegedy in 2004....
It is shown that every non-trivial monotone increasing property of subsets of a set has a threshold ...
We define a class of bipartite graphs that correspond naturally with Ferrers diagrams. We give expre...
Abstract. We consider a variety of connections between threshold graphs, shifted complexes, and simp...
A total dominating set in a graph is a set of vertices such that every vertex of the graph has a nei...
AbstractWe consider a variety of connections between threshold graphs, shifted complexes, and simpli...
Abstract. We consider the following fundamental realization problem of directed graphs. Given a sequ...
The recognition of threshold graphs, those graphs with threshold dimension one, is well understood a...
A graph G on n vertices is a threshold graph if there exist real numbers $$a:1,a_2, \ldots, a_n$$ an...
Abstract. A graphG = (V, E) is a threshold tolerance if it is possible to associate weights and tole...
AbstractA graph G is called a strict 2-threshold graph if its edge-set can be partitioned into two t...
DOI
Add to ORKG