Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in d-space, with distance parameter r and intensities λ,μ. For any λ>0 we consider the percolation threshold μc(λ) associated to the parameter μ. Denoting by λc the percolation threshold for the standard Poisson Boolean model with radii r, we show the lower bound μc(λ)≥clog(c∕(λ−λc)) for any λ>λc with c>0 a fixed constant. In particular, there is no phase transition in μ at the critical value of λ, that is, μc(λc) =∞.

Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in d-space, with distance parameter r and intensities λ and μ. We show for d ≥ 2 that if λ is supercritical for the one-type random geometric graph with distance parameter 2r, there exists μ such that (λ, μ) is supercritical (this was previously known for d = 2). For d = 2, we also consider the restriction of this graph to points in the unit square. Taking μ = τ λ for fixed τ, we give a strong law of large numbers as λ → ∞ for the connectivity threshold of this graph.