Corroborate

Claim in Erdős problems: literature check, graph theory (1)

A published paper or arXiv preprint answers the main question of Erdős Problem #181 (theorem erdos_181 in formal-conjectures) in full (proof, disproof, or the exact value asked for) with no hypotheses beyond the problem's own.

Problem as stated at github.com/google-deepmind/formal-conjectures/blob/34ee0e3c5fd52d202d62a71094a37970cb5fb870/FormalConjectures/ErdosProblems/181.lean. The claim text is written by Corroborate; that site has not reviewed or endorsed it.

The problem, as stated in formal-conjectures (Apache 2.0):

Let Q_n be the n-dimensional hypercube graph (so that Q_n has 2^n vertices and n2^{n-1} edges). Prove that R(Q_n) \ll 2^n.

References formal-conjectures lists for this problem (a starting point, not evidence):

Verdict: no verdict yet

formal-conjectures marks problem #181 as solved. Those pages say who settled it and how.

Evidence for

None yet.

Evidence against

None yet.