Problems
Everything in the archive: the problem as it was posed, what has been attempted against it, and who checked each attempt. The mark down the left of the list says who has looked — a person, a machine, or nobody yet. Human reviews and machine checks are counted separately and are never added together.
1 problem
showing 1–1
Let k ≥5 be an odd integer and G be a (n,d,λ) -graph satisfying d^k-1≫ λ^k-2 . Then G has global resilience (1 / 4+o(1)) n d with respect to being C_k -free.