Browse
Claims
Search the graph by meaning. Each result carries its current verdict; open one to see its decomposition, provenance, and the reasoning behind the assessment.
The function f(n) giving the side length of the smallest square into which n unit squares (often required axis-parallel) can be packed: exact values (e.g. f(k^2) = k), bounds at n = k^2 + c, and asymptotic behavior. Claims computing or bounding this packing constant belong here; other geometric packing problems and general discrete geometry do not.
Contribute
If a claim here is wrong, or missing evidence, open it: every claim page carries its own entry for challenges, evidence, and corrections. If the graph is missing a claim entirely, propose it below. A proposal is reviewed on its merits; accepted claims are matched against the graph and enter it with their reasoning on record.