A simple and sharper proof of the hypergraph Moore bound

Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty. A simple and sharper proof of the hypergraph Moore bound. In Nikhil Bansal 0001, Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023. pages 2324-2344, SIAM, 2023. [doi]

Abstract

Abstract is missing.