Id: palomar/PALOMAR-2026-11-19-000006 Url: https://github.com/VictorLiwentao/fc-palomar-proofs/tree/2d98cec293e789475e9cf9372472c600ecb2c64b Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-19-000006-v1.json Repo: https://github.com/VictorLiwentao/fc-palomar-proofs Tags: math.CO, msc:05C35 Score: 0 Title: Erdős Problem 766: the Dirac–Erdős bound Trust: high Domain: math.CO Source: palomar Authors: Wentao Li Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-19 Formalized: true Formalizes: title=Extremal problems in graph theory identifier=Theory of Graphs and its Applications (Smolenice 1963), 1964, 29-36 relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-19-000006 Every graph on n vertices with floor(n^2/4)+1 edges contains, for each 3 <= k <= n, a subgraph on k vertices with floor(k^2/4)+1 edges. For k = 3 this is Mantel's theorem. Dirac (1963) and Erdős (1964) proved it independently. It is the case l = floor(k^2/4)+1 of Erdős Problem 766, on the least number of edges f(n;k,l) that forces a k-vertex subgraph with l edges.