Exact information ratios for secret sharing on small graphs with girth at least 5

Károly Harsányi, Péter Ligeti. Exact information ratios for secret sharing on small graphs with girth at least 5. J. Mathematical Cryptology, 13(2):107-116, 2019. [doi]

@article{HarsanyiL19,
  title = {Exact information ratios for secret sharing on small graphs with girth at least 5},
  author = {Károly Harsányi and Péter Ligeti},
  year = {2019},
  doi = {10.1515/jmc-2018-0024},
  url = {https://doi.org/10.1515/jmc-2018-0024},
  researchr = {https://researchr.org/publication/HarsanyiL19},
  cites = {0},
  citedby = {0},
  journal = {J. Mathematical Cryptology},
  volume = {13},
  number = {2},
  pages = {107-116},
}