AbstractLet G(n, p) be a graph with n labelled vertices in which each edge is present independently with probability p = p(n) and let C(k; n, p) be the maximal subgraph of G(n, p) with the minimal degree at least k = k(n). In this paper we estimate the size of C(k; n, p) and consider the probability that C(k; n, p) is k-connected when n→∞
The n‐dimensional cube Qn is the graph whose vertices are the subsets of {1, n} where two such verti...
This paper is dedicated to the memory of Paul Erdős. We consider the diameter of a random graph G(n,...
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. In our prev...
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. We let n → ...
We study the k‐core of a random (multi)graph on n vertices with a given degree sequence. We let n →∞...
We study the k‐core of a random (multi)graph on n vertices with a given degree sequence. We let n →∞...
We study the k‐core of a random (multi)graph on n vertices with a given degree sequence. We let n →∞...
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. We let n ! ...
We consider random subgraphs of a fixed graph G = (V,E) with large minimum degree. We fix a positive...
We consider random subgraphs of a fixed graph G = (V,E) with large minimum degree. We fix a positive...
We consider random subgraphs of a fixed graph G = (V,E) with large minimum degree. We fix a positive...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
<p>We consider random sub-graphs of a fixed graph G=(V,E) with large minimum degree. We fix a positi...
We consider random sub-graphs of a fixed graph G=(V,E) with large minimum degree. We fix a positive ...
The k-core of a graph is the maximal induced subgraph with minimum degree k. In this paper, we nd co...
The n‐dimensional cube Qn is the graph whose vertices are the subsets of {1, n} where two such verti...
This paper is dedicated to the memory of Paul Erdős. We consider the diameter of a random graph G(n,...
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. In our prev...
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. We let n → ...
We study the k‐core of a random (multi)graph on n vertices with a given degree sequence. We let n →∞...
We study the k‐core of a random (multi)graph on n vertices with a given degree sequence. We let n →∞...
We study the k‐core of a random (multi)graph on n vertices with a given degree sequence. We let n →∞...
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. We let n ! ...
We consider random subgraphs of a fixed graph G = (V,E) with large minimum degree. We fix a positive...
We consider random subgraphs of a fixed graph G = (V,E) with large minimum degree. We fix a positive...
We consider random subgraphs of a fixed graph G = (V,E) with large minimum degree. We fix a positive...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
<p>We consider random sub-graphs of a fixed graph G=(V,E) with large minimum degree. We fix a positi...
We consider random sub-graphs of a fixed graph G=(V,E) with large minimum degree. We fix a positive ...
The k-core of a graph is the maximal induced subgraph with minimum degree k. In this paper, we nd co...
The n‐dimensional cube Qn is the graph whose vertices are the subsets of {1, n} where two such verti...
This paper is dedicated to the memory of Paul Erdős. We consider the diameter of a random graph G(n,...
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. In our prev...
DOI
Add to ORKG