\newcommand{\etalchar}[1]{$^{#1}$}
\begin{thebibliography}{DCKN{\etalchar{+}}20}

\bibitem[BR10]{Babu2010AnEB}
Ajesh Babu and Jaikumar Radhakrishnan.
\newblock An entropy based proof of the moore bound for irregular graphs.
\newblock {\em ArXiv}, abs/1011.1058, 2010.
\newblock URL: \url{https://api.semanticscholar.org/CorpusID:18756806}.

\bibitem[DCKN{\etalchar{+}}20]{FirstPassage}
Hugo Duminil-Copin, Harry Kesten, Fedor Nazarov, Yuval Peres, and Vladas
  Sidoravicius.
\newblock On the number of maximal paths in directed last-passage percolation.
\newblock {\em Ann. Probab.}, 48(5):2176--2188, 2020.
\newblock \href {https://doi.org/10.1214/19-AOP1419}
  {\path{doi:10.1214/19-AOP1419}}.

\bibitem[MW09]{MeshulamW09}
Roy Meshulam and N.~Wallach.
\newblock Homological connectivity of random \emph{k}-dimensional complexes.
\newblock {\em Random Struct. Algorithms}, 34(3):408--417, 2009.
\newblock URL: \url{https://doi.org/10.1002/rsa.20238}, \href
  {https://doi.org/10.1002/RSA.20238} {\path{doi:10.1002/RSA.20238}}.

\bibitem[RY20]{rao_yehudayoff_2020}
Anup Rao and Amir Yehudayoff.
\newblock {\em Communication Complexity: and Applications}.
\newblock Cambridge University Press, 2020.
\newblock \href {https://doi.org/10.1017/9781108671644}
  {\path{doi:10.1017/9781108671644}}.

\end{thebibliography}
