Forgot password? New user? Sign up

Existing user? Log in

What is the minimal number $k$ such that there exists a proper edge coloring of the complete graph on 8 vertices with $k$ colors?

Problem Loading...

Note Loading...

Set Loading...