{"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","summary":"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.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-19","reactions":{},"formalized":true,"formalizes":[{"title":"Extremal problems in graph theory","identifier":"Theory of Graphs and its Applications (Smolenice 1963), 1964, 29-36","relationship":"formalizes"}]}