Plane and planarity thresholds for random geometric graphs

DOI10.1142/S1793830920500056zbMath1433.05274OpenAlexW2980424017MaRDI QIDQ5216443

Anil Maheshwari, Ahmad Biniaz, Michiel H. M. Smid, Evangelos Kranakis

Publication date: 18 February 2020

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830920500056

zbMATH Keywords

planar graphplane graphrandom geometric graphdistance threshold

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) General theory of incidence groups (51J05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the bottleneck plane perfect matching of a point set
• On the coverage of k-dimensional space by k-dimensional spheres
• Random coverings in several dimensions
• Threshold functions
• The longest edge of the random minimal spanning tree
• The connectivity of a graph on uniform points on [0,\,1\(^{d}\).]
• On Sharp Thresholds in Random Geometric Graphs
• Critical Density Thresholds in Distributed Wireless Networks
• Sharp thresholds For monotone properties in random geometric graphs
• Random Plane Networks
• Random Geometric Graphs
• Every monotone graph property has a sharp threshold
• Threshold Functions for Random Graphs on a Line Segment
• On the connectivity of a random interval graph
• Random Graphs

This page was built for publication: Plane and planarity thresholds for random geometric graphs