Sharp threshold for embedding balanced spanning trees in random geometric graphs
From MaRDI portal
Publication:6595519
DOI10.1002/jgt.23106zbMATH Open1546.05132MaRDI QIDQ6595519
Alberto Espuny Díaz, Alexandra Wesolek, Lyuben Lichev, Dieter Mitsche
Publication date: 30 August 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connectivity of soft random geometric graphs
- Hamilton cycles in random geometric graphs
- An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs
- The longest edge of the random minimal spanning tree
- Spanning trees in random graphs
- Monotone properties of random geometric graphs have sharp thresholds
- On Sharp Thresholds in Random Geometric Graphs
- Disjoint Hamilton cycles in the random geometric graph
- Random Plane Networks
- Sublinear-Time Parallel Algorithms for Matching and Related Problems
- Random Geometric Graphs
- On Representatives of Subsets
- Threshold Functions for Random Graphs on a Line Segment
- On the connectivity of a random interval graph
- Lectures on random geometric graphs
- Sharp Threshold for Hamiltonicity of Random Geometric Graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- On the first and second largest components in the percolated random geometric graph
This page was built for publication: Sharp threshold for embedding balanced spanning trees in random geometric graphs
