Longest and shortest cycles in random planar graphs

DOI10.1002/rsa.21040zbMath1522.05069arXiv2006.09697OpenAlexW3194880697MaRDI QIDQ6074691

Michael Missethan, Mihyun Kang

Publication date: 12 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.09697

zbMATH Keywords

cyclesrandom graphsplanar graphsblocksPólya urn

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Combinatorial probability (60C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

Concentration of maximum degree in random planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random graphs on surfaces
• Classes of orderings of measures and related correlation inequalities. II. Multivariate reverse rule distributions
• The longest path in a random graph
• Some concepts of negative dependence
• Random planar graphs
• On the connectivity of random graphs from addable classes
• Limits of random tree-like discrete structures
• Asymptotic enumeration and limit laws for graphs of fixed genus
• Connectivity of addable graph classes
• Two critical periods in the evolution of random planar graphs
• Graph classes with given 3-connected components: Asymptotic enumeration and random graphs
• Introduction to Random Graphs
• On the diameter of random planar graphs
• Asymptotic enumeration and limit laws of planar graphs
• On the Maximum Degree of a Random Planar Graph
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process
• Cycles in a random graph near the critical point
• Almost all cubic graphs are Hamiltonian
• The Structure of a Random Graph at the Point of the Phase Transition
• The Evolution of Random Graphs on Surfaces
• On the Behavior of a Random Graph Near a Critical Point
• Phase transitions in graphs on orientable surfaces
• The birth of the giant component
• On the probability of planarity of a random graph near the critical point

This page was built for publication: Longest and shortest cycles in random planar graphs