{
  "id": "1405.3252",
  "version": "v1",
  "published": "2014-05-13T18:43:24.000Z",
  "updated": "2014-05-13T18:43:24.000Z",
  "title": "Acquaintance time of random graphs near connectivity threshold",
  "authors": [
    "Andrzej Dudek",
    "Pawel Pralat"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "Benjamini, Shinkar, and Tsur stated the following conjecture on the acquaintance time: asymptotically almost surely $AC(G) \\le p^{-1} \\log^{O(1)} n$ for a random graph $G \\in G(n,p)$, provided that $G$ is connected. Recently, Kinnersley, Mitsche, and the second author made a major step towards this conjecture by showing that asymptotically almost surely $AC(G) = O(\\log n / p)$, provided that $G$ has a Hamiltonian cycle. In this paper, we finish the task by showing that the conjecture holds in the strongest possible sense, that is, it holds right at the time the random graph process creates a connected graph. Moreover, we generalize and investigate the problem for random hypergraphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-05-13T18:43:24.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "acquaintance time",
      "connectivity threshold",
      "random graph process creates",
      "conjecture holds",
      "second author"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1405.3252D"
    }
  }
}