AbstractConsider a random graph K(n, p) with n labeled vertices in which the edges are chosen independently and with a probability p. Let Tn(p) be the order of the largest induced tree in K(n, p). Among other results it is shown, using an algorithmic approach, that if p=(c log n)/n, where c ≥ e is a constant, then for any fixed ε > 01c−εlog lognlognn<Tn(p)<2c+εlog lognlogn almost surely
textabstractFor the Erd\H{o}s-R\'enyi random graph $G_{n,p}$, we consider the order of a largest ver...
For the Erdos-Rényi random graph Gn,p, we consider the order of a largest vertex subset that induces...
This paper concerns the degree sequence d1 ≥ d2 ≥ … ≥ dn of a randomly labeled graph of order n in w...
AbstractConsider a random graph K(n, p) with n labeled vertices in which the edges are chosen indepe...
AbstractA study of the orders of maximal induced trees in a random graph Gp with small edge probabil...
AbstractLet Gn,p denote the graph obtained from deleting the edges of Kn, the complete graph with ve...
AbstractWe show that for every ε > 0 almost every graph G ϵ G(n, p) is such that if (1+ϵ)log nlog d ...
AbstractWe consider the size of the largest induced tree in random graphs, random regular graphs and...
AbstractIn this paper we study the problem of finding the largest tree in a random graph. First of a...
AbstractLet H(n, p) denote the size of the largest induced cycle in a random graph G(n, p). It is sh...
AbstractLet r be any integer ≥2. There exist absolute constants C1 and C2 such that if G(N, p) denot...
Abstract. Let G be a graph and let I(G) be defined by I(G) = max{|F | : F is an induced forest in G...
Abstract. Let ccl(G) denote the order of the largest complete minor in a graph G (also called the co...
AbstractLet t(G) be the maximum size of a subset of vertices of a graph G that induces a tree. We in...
The random graph order P n, p is obtained from a random graph G n, p on [n] by treating an edge betw...
textabstractFor the Erd\H{o}s-R\'enyi random graph $G_{n,p}$, we consider the order of a largest ver...
For the Erdos-Rényi random graph Gn,p, we consider the order of a largest vertex subset that induces...
This paper concerns the degree sequence d1 ≥ d2 ≥ … ≥ dn of a randomly labeled graph of order n in w...
AbstractConsider a random graph K(n, p) with n labeled vertices in which the edges are chosen indepe...
AbstractA study of the orders of maximal induced trees in a random graph Gp with small edge probabil...
AbstractLet Gn,p denote the graph obtained from deleting the edges of Kn, the complete graph with ve...
AbstractWe show that for every ε > 0 almost every graph G ϵ G(n, p) is such that if (1+ϵ)log nlog d ...
AbstractWe consider the size of the largest induced tree in random graphs, random regular graphs and...
AbstractIn this paper we study the problem of finding the largest tree in a random graph. First of a...
AbstractLet H(n, p) denote the size of the largest induced cycle in a random graph G(n, p). It is sh...
AbstractLet r be any integer ≥2. There exist absolute constants C1 and C2 such that if G(N, p) denot...
Abstract. Let G be a graph and let I(G) be defined by I(G) = max{|F | : F is an induced forest in G...
Abstract. Let ccl(G) denote the order of the largest complete minor in a graph G (also called the co...
AbstractLet t(G) be the maximum size of a subset of vertices of a graph G that induces a tree. We in...
The random graph order P n, p is obtained from a random graph G n, p on [n] by treating an edge betw...
textabstractFor the Erd\H{o}s-R\'enyi random graph $G_{n,p}$, we consider the order of a largest ver...
For the Erdos-Rényi random graph Gn,p, we consider the order of a largest vertex subset that induces...
This paper concerns the degree sequence d1 ≥ d2 ≥ … ≥ dn of a randomly labeled graph of order n in w...
DOI
Add to ORKG