Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_09_29_chao_huang_liu: An arXiv preprint of Chao, Huang and Liu claims the limit of whenever with , in closed form depending on the parity of , except for -graphs with even , where it shows for that the limit exceeds . This answers the problem to first order on that family only.
Linked from (1)
Graph