Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2024_10_21_bradac_christoph: Theorem 1.2 of Bradač and Christoph: a graph on n vertices has o(2^(n choose 2)/n!) unique subgraphs, so the answer is no; published in Proc. Amer. Math. Soc. 153 (2025), credited by the site's curator, with public Lean of 2026.
Linked from (1)
Graph