BRBruce Reed
Bruce Reed
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Bruce Reed has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Adam Bene Watts
School of Computer Science, McGill University; Montreal Quebec Canada H3A 0G4
2 shared publications - Guillem Perarnau
School of Mathematics University of Birmingham Birmingham UK
2 shared publications - Xing Shi Cai
Department of Mathematics Uppsala University Sweden
2 shared publications - Dieter Rautenbach
Ulm University
1 shared publication - Felix Joos
School of Mathematics University of Birmingham Edgbaston B15 2TT Birmingham United Kingdom
1 shared publication Guillem Perarnau
School of Mathematics University of Birmingham B15 2TT Birmingham UK
1 shared publication
Latest Publications
- 7 June 2017
- Published by Springer Nature in Mathematical Programming
- Vol. 171 (1-2) , 519-522
Polyhedral results on the stable set problem in graphs containing even or odd pairs
- 7 June 2017
- Published by Springer Nature in Mathematical Programming
- Vol. 171 (1-2) , 519-522
Polyhedral results on the stable set problem in graphs containing even or odd pairs
- Open Access
How to determine if a random graph with a fixed degree sequence has a giant component
For a fixed degree sequence $\mathcal{D}=(d_1,...,d_n)$, let $G(\mathcal{D})$ be a uniformly chosen (simple) graph on $\{1,...,n\}$ where the vertex $i$ has degree $d_i$. In this paper we determine whether $G(\mathcal{D})$ has a giant component with high probability, essentially imposing no conditions on $\mathcal{D}$. We simply insist that the sum of the degrees in $\mathcal{D}$ which are not 2 is at least $\lambda(n)$ for some function $\lambda$ going to infinity with $n$. This is a relatively minor technical condition, and when $\mathcal{D}$ does not satisfy it, both the probability that $G(\mathcal{D})$ has a giant component and the probability that $G(\mathcal{D})$ has no giant component are bounded away from $1$.Open AccessHow to determine if a random graph with a fixed degree sequence has a giant component
For a fixed degree sequence $\mathcal{D}=(d_1,...,d_n)$, let $G(\mathcal{D})$ be a uniformly chosen (simple) graph on $\{1,...,n\}$ where the vertex $i$ has degree $d_i$. In this paper we determine whether $G(\mathcal{D})$ has a giant component with high probability, essentially imposing no conditions on $\mathcal{D}$. We simply insist that the sum of the degrees in $\mathcal{D}$ which are not 2 is at least $\lambda(n)$ for some function $\lambda$ going to infinity with $n$. This is a relatively minor technical condition, and when $\mathcal{D}$ does not satisfy it, both the probability that $G(\mathcal{D})$ has a giant component and the probability that $G(\mathcal{D})$ has no giant component are bounded away from $1$. - Open Access
- 3 November 2016
- Published by Wiley in Random Structures & Algorithms
- Vol. 50 (4) , 511-533
Acyclic edge colourings of graphs with large girth
- 3 November 2016
- Published by Wiley in Random Structures & Algorithms
- Vol. 50 (4) , 511-533
Open AccessAcyclic edge colourings of graphs with large girth
- Open Access
Acyclic edge colourings of graphs with large girth
An edge colouring of a graph $G$ is called acyclic if it is proper and every cycle contains at least three colours. We show that for every $\varepsilon>0$, there exists a $g=g(\varepsilon)$ such that if $G$ has girth at least $g$ then $G$ admits an acyclic edge colouring with at most $(1+\varepsilon)\Delta$ colours.Open AccessAcyclic edge colourings of graphs with large girth
An edge colouring of a graph $G$ is called acyclic if it is proper and every cycle contains at least three colours. We show that for every $\varepsilon>0$, there exists a $g=g(\varepsilon)$ such that if $G$ has girth at least $g$ then $G$ admits an acyclic edge colouring with at most $(1+\varepsilon)\Delta$ colours.