On the intersection graph of random caps on a sphere

DOI10.1016/J.EJC.2003.10.005zbMATH Open1049.60008OpenAlexW2090816765MaRDI QIDQ1827342FDOQ1827342

Authors: Yanyan Li 

Publication date: 6 August 2004

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2003.10.005

Recommendations

• The bound on Poisson approximation for the number of edges in a random intersection graph on the surface of a sphere
• A threshold for the size of random caps to cover a sphere
• When does the union of random spherical caps become connected?
• On a condition for the union of spherical caps to be connected
• On the isolated vertices and connectivity in random intersection graphs

zbMATH Keywords

intersection graphsspherical capsrandom caps

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The square of every two-connected graph is Hamiltonian
• A threshold for the size of random caps to cover a sphere
• On a condition for the union of spherical caps to be connected
• Title not available (Why is that?)
• Title not available (Why is that?)
• The length of the shortest edge of a graph on a sphere

Cited In (3)

• When does the union of random spherical caps become connected?
• A threshold for the size of random caps to cover a sphere
• On a condition for the union of spherical caps to be connected

This page was built for publication: On the intersection graph of random caps on a sphere

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827342)