Skip to content

Erdős problem 1028

Let H(n)=minfmaxX{1,,n}x<yXf(x,y),H(n)=\min_f \max_{X\subseteq \{1,\ldots,n\}} \left\lvert \sum_{x<y\in X} f(x,y)\right\rvert, where ff ranges over all functions f:{1,,n}2{1,1}f:\{1,\ldots,n\}^2\to \{-1,1\}. Estimate H(n)H(n).

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:adf421d4629bf9310d1f5264c7dd6464f1f10131f22128405f6ad0acea8a1b35
Metadata
sha256:e598746dee88bb0665069585c2c228e07938d233be30da59c505f8506d1e2ee2
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:7412dab12434056cdada5687d06fc5f184d16cedfaaadab3d5b68e3961e2a254
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page