Erdős problem 775 · problems.science

Is there a $3$ -uniform hypergraph on $n$ vertices which contains at least $n-O(1)$ different sizes of cliques (maximal complete subgraphs)?

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.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:aa0ed33156fcf82d4a5f3d0c094feea96f40ffd64804caa16f4cd0c23290ae77
Metadata: sha256:a9659df6c69af3c12ad69d2df39154747eafd3c502988e176448e38e382b1735
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:ed344938062e42d95ca198f3ed132162e10c1854ab6adcce62472c3af0dd3d3c

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207