"An improved lower bound on the length of the longest cycle in random graphs."

Michael Anastos (2022)

Details and statistics

DOI: 10.48550/ARXIV.2208.06851

access: open

type: Informal or Other Publication

metadata version: 2022-08-17

a service of  Schloss Dagstuhl - Leibniz Center for Informatics