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
International audienceWe present a unified general method for the asymptotic study of graphs from th...
We present a unified general method for the asymptotic study of graphs from the so-called subcritica...
AbstractLet Gn,d denote the uniformly random d-regular graph on n vertices. For any S⊂[n], we obtain...
AbstractLet Gn be a graph selected at random from the set of all labeled graphs of order n. We show ...
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 ...
Let~$T_n$ denote the set of unrooted labeled trees of size~$n$ and let~$T_n$ be a particular (finite...
The probability that a random labelled r-regular graph contains a given number of cycles of given le...
AbstractThe random graph Kn,p is constructed on n labelled vertices by inserting each of the (n2) po...
Let H be a fixed graph and math formula a subcritical graph class. In this paper we show that the nu...
A random graph on n vertices is a random subgraph of the complete graph on n vertices. By analogy wi...
A random graph on n vertices is a random subgraph of the complete graph on n vertices. By analogy wi...
AbstractThis paper deals with some special types of random graphs, where the initial graphs are path...
AbstractGiven a random graph, we investigate the occurrence of subgraphs especially rich in edges. S...
AbstractWe consider two types of random subgraphs of the n-cube. For these models we study the asymp...
International audienceWe present a unified general method for the asymptotic study of graphs from th...
We present a unified general method for the asymptotic study of graphs from the so-called subcritica...
AbstractLet Gn,d denote the uniformly random d-regular graph on n vertices. For any S⊂[n], we obtain...
AbstractLet Gn be a graph selected at random from the set of all labeled graphs of order n. We show ...
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 ...
Let~$T_n$ denote the set of unrooted labeled trees of size~$n$ and let~$T_n$ be a particular (finite...
The probability that a random labelled r-regular graph contains a given number of cycles of given le...
AbstractThe random graph Kn,p is constructed on n labelled vertices by inserting each of the (n2) po...
Let H be a fixed graph and math formula a subcritical graph class. In this paper we show that the nu...
A random graph on n vertices is a random subgraph of the complete graph on n vertices. By analogy wi...
A random graph on n vertices is a random subgraph of the complete graph on n vertices. By analogy wi...
AbstractThis paper deals with some special types of random graphs, where the initial graphs are path...
AbstractGiven a random graph, we investigate the occurrence of subgraphs especially rich in edges. S...
AbstractWe consider two types of random subgraphs of the n-cube. For these models we study the asymp...
International audienceWe present a unified general method for the asymptotic study of graphs from th...
We present a unified general method for the asymptotic study of graphs from the so-called subcritica...
AbstractLet Gn,d denote the uniformly random d-regular graph on n vertices. For any S⊂[n], we obtain...
DOI
Add to ORKG