DOIAbstract
AbstractLet Gn be a graph selected at random from the set of all labeled graphs of order n. We show that for many a type, the number of induced subgraphs of that type in Gn is asymptotically normally distributed as n tends to infinity
AbstractLet Gn be a graph selected at random from the set of all labeled graphs of order n. We show that for many a type, the number of induced subgraphs of that type in Gn is asymptotically normally distributed as n tends to infinity
We present a unified general method for the asymptotic study of graphs from the so-called subcritica...
Given a monotone graphical property Q, how large should d(n) be to ensure that if (Hn) is any sequen...
Abstract. Let Tn denote the set of unrooted labeled trees of size n and let M be a particular (finit...
AbstractLet Gn be a graph selected at random from the set of all labeled graphs of order n. We show ...
AbstractLet Gn,d denote the uniformly random d-regular graph on n vertices. For any S⊂[n], we obtain...
Let H be a fixed graph and math formula a subcritical graph class. In this paper we show that the nu...
Let H be a fixed graph and math formula a subcritical graph class. In this paper we show that the nu...
For the Erdos-Rényi random graph Gn,p, we consider the order of a largest vertex subset that induces...
textabstractFor the Erd\H{o}s-R\'enyi random graph $G_{n,p}$, we consider the order of a largest ver...
For the Erdős–Rényi random graph Gn,p, we give a precise asymptotic formula for the size â1(Gn,p) of...
For the Erd\H{o}s-R\'enyi random graph $G_{n,p}$, we consider the order of a largest vertex subset t...
For the Erdős–Rényi random graph Gn,pGn,p, we give a precise asymptotic formula for the size αˆt(Gn,...
AbstractThe random graph Kn,p is constructed on n labelled vertices by inserting each of the (n2) po...
For any $S\subset [n]$, we compute the probability that the subgraph of $\mathcal{G}_{n,d}$ induced ...
For any $S\subset [n]$, we compute the probability that the subgraph of $\mathcal{G}_{n,d}$ induced ...
We present a unified general method for the asymptotic study of graphs from the so-called subcritica...
Given a monotone graphical property Q, how large should d(n) be to ensure that if (Hn) is any sequen...
Abstract. Let Tn denote the set of unrooted labeled trees of size n and let M be a particular (finit...
AbstractLet Gn be a graph selected at random from the set of all labeled graphs of order n. We show ...
AbstractLet Gn,d denote the uniformly random d-regular graph on n vertices. For any S⊂[n], we obtain...
Let H be a fixed graph and math formula a subcritical graph class. In this paper we show that the nu...
Let H be a fixed graph and math formula a subcritical graph class. In this paper we show that the nu...
For the Erdos-Rényi random graph Gn,p, we consider the order of a largest vertex subset that induces...
textabstractFor the Erd\H{o}s-R\'enyi random graph $G_{n,p}$, we consider the order of a largest ver...
For the Erdős–Rényi random graph Gn,p, we give a precise asymptotic formula for the size â1(Gn,p) of...
For the Erd\H{o}s-R\'enyi random graph $G_{n,p}$, we consider the order of a largest vertex subset t...
For the Erdős–Rényi random graph Gn,pGn,p, we give a precise asymptotic formula for the size αˆt(Gn,...
AbstractThe random graph Kn,p is constructed on n labelled vertices by inserting each of the (n2) po...
For any $S\subset [n]$, we compute the probability that the subgraph of $\mathcal{G}_{n,d}$ induced ...
For any $S\subset [n]$, we compute the probability that the subgraph of $\mathcal{G}_{n,d}$ induced ...
We present a unified general method for the asymptotic study of graphs from the so-called subcritica...
Given a monotone graphical property Q, how large should d(n) be to ensure that if (Hn) is any sequen...
Abstract. Let Tn denote the set of unrooted labeled trees of size n and let M be a particular (finit...
Add to ORKG