DOIAbstract
It is shown that every non-trivial monotone increasing property of subsets of a set has a threshold function. This generalises a number of classical results in the theory of random graphs. © 1987 Akadémiai Kiadó
It is shown that every non-trivial monotone increasing property of subsets of a set has a threshold function. This generalises a number of classical results in the theory of random graphs. © 1987 Akadémiai Kiadó
AbstractA clutter is k-monotone, completely monotone or threshold if the corresponding Boolean funct...
In their seminal work [6],[7], Erdos and Renyi invented the notion of random graphs and made the fun...
AbstractThis paper deals with three generalizations of threshold graphs to hypergraphs proposed by M...
In the 1950s, random graphs appeared for the first time in a result of the prolific hungarian mathem...
We determine the probability thresholds for the existence of monotone paths, of finite and infinite ...
Consider a monotone Boolean function f:{0,1}^n \to {0,1} and the canonical monotone coupling {eta_p...
Consider a monotone Boolean function f: {0, 1}n → {0, 1} and the canonical monotone coupling {ηp: p ...
We give a characterization of vertex-monotone properties with sharp thresholds in a Poisson random g...
Random geometric graphs result from taking n uniformly distributed points in the unit cube, [0, 1] d...
We consider a non-monotone activation process $(X_t)_{t\in\{ 0,1,2,\ldots\}}$on a graph $G$, where $...
Random geometric graphs result from taking n uniformly distributed points in the unit cube, [0, 1] ...
Abstract: Our main goal with this dissertation is to create a solid base on balanced and unbalanced ...
Abstract. We study the limit theory of large threshold graphs and apply this to a variety of models ...
AbstractIn this paper we prove two multiset analogs of classical results. We prove a multiset analog...
AbstractWe deduce a set of known characterizations of threshold graphs (Theorem 3) from a set of cha...
AbstractA clutter is k-monotone, completely monotone or threshold if the corresponding Boolean funct...
In their seminal work [6],[7], Erdos and Renyi invented the notion of random graphs and made the fun...
AbstractThis paper deals with three generalizations of threshold graphs to hypergraphs proposed by M...
In the 1950s, random graphs appeared for the first time in a result of the prolific hungarian mathem...
We determine the probability thresholds for the existence of monotone paths, of finite and infinite ...
Consider a monotone Boolean function f:{0,1}^n \to {0,1} and the canonical monotone coupling {eta_p...
Consider a monotone Boolean function f: {0, 1}n → {0, 1} and the canonical monotone coupling {ηp: p ...
We give a characterization of vertex-monotone properties with sharp thresholds in a Poisson random g...
Random geometric graphs result from taking n uniformly distributed points in the unit cube, [0, 1] d...
We consider a non-monotone activation process $(X_t)_{t\in\{ 0,1,2,\ldots\}}$on a graph $G$, where $...
Random geometric graphs result from taking n uniformly distributed points in the unit cube, [0, 1] ...
Abstract: Our main goal with this dissertation is to create a solid base on balanced and unbalanced ...
Abstract. We study the limit theory of large threshold graphs and apply this to a variety of models ...
AbstractIn this paper we prove two multiset analogs of classical results. We prove a multiset analog...
AbstractWe deduce a set of known characterizations of threshold graphs (Theorem 3) from a set of cha...
AbstractA clutter is k-monotone, completely monotone or threshold if the corresponding Boolean funct...
In their seminal work [6],[7], Erdos and Renyi invented the notion of random graphs and made the fun...
AbstractThis paper deals with three generalizations of threshold graphs to hypergraphs proposed by M...
Add to ORKG