Brilliant

Today Courses

This holiday season, spark a lifelong love of learning. Gift Brilliant Premium

Excel in math and science.

Log in with Facebook Log in with Google Log in with email

Join using Facebook Join using Google Join using email

Forgot password? New user? Sign up

Existing user? Log in

Edge Coloring Complete

Probability

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

15 8 7 28

View solutions

Your answer seems reasonable. Find out if you're right!

Sign up to access problem solutions.

That seems reasonable. Find out if you're right!

Sign up to save your progress!

Log in with Facebook Log in with Google Log in with email

Join using Facebook Join using Google Join using email

Forgot password? New user? Sign up

Existing user? Log in

by Henry Maltby

×

Problem Loading...

Note Loading...

Set Loading...