Add to ORKGpublished source has been acknowledged. journal website http://www.combinatorics.org/Volume_6/v6i1toc.htmlWe prove that the threshold for a random graph to have a k-core is equal to the threshold for having a subgraph which meets a necessary condition of Gallai for being k-critical
The k-core of a graph is the maximal induced subgraph with minimum degree k. In this paper, we nd co...
AbstractA graph G is said to be k-critical if it has chromatic number k but every proper subgraph of...
A graph G is k-critical if it has chromatic number k, but every proper subgraph of G is (k − 1)–colo...
published source has been acknowledged. journal website http://www.combinatorics.org/Volume_6/v6i1to...
The k-core of a graph G is the maximal subgraph of G having minimum degree at least k. In 1996, Pitt...
A graph G=(V,E) is a mathematical model for a network with vertex set V and edge set E. A Random Gra...
We prove that almost surely the first non-empty (k+1)-core to arise during the ran-dom graph process...
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. In our prev...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. In our prev...
“This is a preprint of an article accepted for publication in [Random Structures and Algorithms] co...
pubulished source © SIAM Inc. 2004We describe a technique for determining the thresholds for the app...
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. We let n → ...
We prove that, for k ≥ 2, the k-orientability threshold for the random graph Gn,p coincides with the...
AbstractWe describe a novel subgraph of k-partite graphs suddenly appearing at an average degree c=4...
The k-core of a graph is the maximal induced subgraph with minimum degree k. In this paper, we nd co...
AbstractA graph G is said to be k-critical if it has chromatic number k but every proper subgraph of...
A graph G is k-critical if it has chromatic number k, but every proper subgraph of G is (k − 1)–colo...
published source has been acknowledged. journal website http://www.combinatorics.org/Volume_6/v6i1to...
The k-core of a graph G is the maximal subgraph of G having minimum degree at least k. In 1996, Pitt...
A graph G=(V,E) is a mathematical model for a network with vertex set V and edge set E. A Random Gra...
We prove that almost surely the first non-empty (k+1)-core to arise during the ran-dom graph process...
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. In our prev...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. In our prev...
“This is a preprint of an article accepted for publication in [Random Structures and Algorithms] co...
pubulished source © SIAM Inc. 2004We describe a technique for determining the thresholds for the app...
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. We let n → ...
We prove that, for k ≥ 2, the k-orientability threshold for the random graph Gn,p coincides with the...
AbstractWe describe a novel subgraph of k-partite graphs suddenly appearing at an average degree c=4...
The k-core of a graph is the maximal induced subgraph with minimum degree k. In this paper, we nd co...
AbstractA graph G is said to be k-critical if it has chromatic number k but every proper subgraph of...
A graph G is k-critical if it has chromatic number k, but every proper subgraph of G is (k − 1)–colo...