In this paper, we prove that there exists a function ρ k = (4+o(1))k such that G(n, ρ/n) contains a k-regular graph with high probability whenever ρ \u3e ρ k. In the case of k = 3, it is also shown that G(n, ρ/n) contains a 3-regular graph with high probability whenever ρ \u3e λ ≈ 5.1494. These are the first constant bounds on the average degree in G(n, p) for the existence of a k-regular subgraph. We also discuss the appearance of 3-regular subgraphs in cores of random graphs. © 2006 Wiley Periodicals, Inc
<p>We consider random sub-graphs of a fixed graph G=(V,E) with large minimum degree. We fix a positi...
ABSTRACT: Random d-regular graphs have been well studied when d is fixed and the number of vertices ...
AbstractWe analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove th...
In this paper, we prove that there exists a function ρ k = (4+o(1))k such that G(n, ρ/n) contains a ...
AbstractLet Gn,d denote the uniformly random d-regular graph on n vertices. For any S⊂[n], we obtain...
The k-core of a graph is the maximal induced subgraph with minimum degree k. In this paper, we nd co...
AbstractThe small subgraph conditioning method first appeared when Robinson and the second author sh...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
AbstractThe main aim of this short paper is to answer the following question. Given a fixed graph H,...
We investigate the computationally hard problem whether a random graph of finite average vertex degr...
In this paper, we completely resolve the well-known problem of ErdÅ s and Sauer from 1975 which asks...
We consider random subgraphs of a fixed graph G = (V,E) with large minimum degree. We fix a positive...
41 pagesInternational audienceThe modularity of a graph is a parameter introduced by Newman and Girv...
We study the k‐core of a random (multi)graph on n vertices with a given degree sequence. We let n →∞...
AbstractGiven a graph G and an integer r, does there exist a regular subgraph of G with degree r? In...
<p>We consider random sub-graphs of a fixed graph G=(V,E) with large minimum degree. We fix a positi...
ABSTRACT: Random d-regular graphs have been well studied when d is fixed and the number of vertices ...
AbstractWe analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove th...
In this paper, we prove that there exists a function ρ k = (4+o(1))k such that G(n, ρ/n) contains a ...
AbstractLet Gn,d denote the uniformly random d-regular graph on n vertices. For any S⊂[n], we obtain...
The k-core of a graph is the maximal induced subgraph with minimum degree k. In this paper, we nd co...
AbstractThe small subgraph conditioning method first appeared when Robinson and the second author sh...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
AbstractThe main aim of this short paper is to answer the following question. Given a fixed graph H,...
We investigate the computationally hard problem whether a random graph of finite average vertex degr...
In this paper, we completely resolve the well-known problem of ErdÅ s and Sauer from 1975 which asks...
We consider random subgraphs of a fixed graph G = (V,E) with large minimum degree. We fix a positive...
41 pagesInternational audienceThe modularity of a graph is a parameter introduced by Newman and Girv...
We study the k‐core of a random (multi)graph on n vertices with a given degree sequence. We let n →∞...
AbstractGiven a graph G and an integer r, does there exist a regular subgraph of G with degree r? In...
<p>We consider random sub-graphs of a fixed graph G=(V,E) with large minimum degree. We fix a positi...
ABSTRACT: Random d-regular graphs have been well studied when d is fixed and the number of vertices ...
AbstractWe analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove th...