Displaying similar documents to “Recurrence of distributional limits of finite planar graphs.”

A Note on Uniquely Embeddable Forests

Justyna Otfinowska, Mariusz Woźniak (2013)

Discussiones Mathematicae Graph Theory

Similarity:

Let F be a forest of order n. It is well known that if F 6= Sn, a star of order n, then there exists an embedding of F into its complement F. In this note we consider a problem concerning the uniqueness of such an embedding.

Encores on cores.

Cain, Julie, Wormald, Nicholas (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The sizes of components in random circle graphs

Ramin Imany-Nabiyyi (2008)

Discussiones Mathematicae Graph Theory

Similarity:

We study random circle graphs which are generated by throwing n points (vertices) on the circle of unit circumference at random and joining them by an edge if the length of shorter arc between them is less than or equal to a given parameter d. We derive here some exact and asymptotic results on sizes (the numbers of vertices) of "typical" connected components for different ways of sampling them. By studying the joint distribution of the sizes of two components, we "go into" the structure...