Journal of Combinatorics

Volume 12 (2021)

Number 4

Random graphs induced by Catalan pairs

Pages: 663 – 724

DOI: https://dx.doi.org/10.4310/JOC.2021.v12.n4.a5

Authors

Daniël Kroes (University of California, San Diego, Calif., U.S.A.)

Sam Spiro (University of California, San Diego, Calif., U.S.A.)

Abstract

We consider Catalan-pair graphs, a family of graphs that can be viewed as representing certain interactions between pairs of objects which are enumerated by the Catalan numbers. In this paper we study random Catalan-pair graphs and deduce various properties of these random graphs. In particular, we asymptotically determine the expected number of edges and isolated vertices, and more generally we determine the expected number of (induced) subgraphs isomorphic to a given connected graph.

Keywords

Catalan number, random graphs, circle graphs

The full text of this article is unavailable through your IP address: 18.191.26.149

Received 5 March 2020

Accepted 15 September 2020

Published 31 January 2022