{
  "id": "1902.08876",
  "version": "v1",
  "published": "2019-02-24T02:06:46.000Z",
  "updated": "2019-02-24T02:06:46.000Z",
  "title": "Random graphs induced by Catalan pairs",
  "authors": [
    "Daniël Kroes",
    "Sam Spiro"
  ],
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-02-24T02:06:46.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C80"
    ],
    "keywords": [
      "random graphs",
      "catalan pairs",
      "study random catalan-pair graphs",
      "expected number",
      "catalan numbers"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}