My Erdös number is less than or equal to 4. For details on Erdös numbers see the homepage of the Erdös Number Project.

Proof: We prove that there is the following path of length 4 in the publication graph:
Paul Erdös - Svante Janson - Andrew D. Barbour - Volker Schmidt - Johannes Mayer.

  1. Paul Erdös, Svante Janson, Tomasz Luczak, Joel Spencer: A Note on Triangle-Free Graphs. (David Aldous and Robin Pemantle, eds.) Random Discrete Structures (Proceedings, Minneapolis, 1993), IMA Volumes in Mathematics and Its Applications, vol. 76, Springer, New York, 1996, pp. 117-119.
  2. Andrew D. Barbour, Svante Janson, Michal Karonski, Andrzej Rucinski: Small Cliques in Random Graphs. Random Structures and Algorithms, vol. 1, no. 4, 1990, pp. 403-434.
  3. Andrew D. Barbour, Volker Schmidt: On Laslett's Transform for the Boolean Model. Advances in Applied Probability, vol. 33, 2001, pp. 1-5.
  4. Roland Maier, Johannes Mayer, Volker Schmidt: Distributional Properties of the Typical Cell of Stationary Iterated Tessellations. Mathematical Methods of Operations Research, vol. 59, no. 2, 2004, pp. 287-302.