My Erdős number

I have an Erdős number of 4 through the following chain of papers.
  1. J. Li, O. Makkonen, C. Hollanti, and O. W. Gnilke, “Efficient Recovery of a Shared Secret via Cooperation: Applications to SDMM and PIR,” IEEE Journal on Selected Areas in Communications, vol. 40, 2022.
  2. S. R. Blackburn, M. Greferath, C. Hollanti, M. O. Pavčević, J. Rosenthal, L. Storme, et al., “Preface to the special issue on network coding and designs,” Designs, Codes and Cryptography, 237-238, 2018.
  3. A. Blokhuis, L. Lovász, L. Storme, T. Szőnyi, “On multiple blocking sets in Galois planes,” Adv. Geom. 7, no. 1, 39–53, 2007.
  4. P. Erdős, L. Lovász, “Problems and results on 3-chromatic hypergraphs and some related questions,” Colloquia Mathematica Societatis Janos Bolyai 10. Infinite and Finite Sets, Keszthely (Hungary), 1973.
You can compute your own Erdős number using the collaboration distance calculator here.