Brilliant

Practice

Algebra
Geometry
Number Theory
Calculus
Discrete Mathematics
Basic Mathematics
Logic
Classical Mechanics
Electricity and Magnetism
Computer Science
Quantitative Finance
Chemistry

rocket with vector

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

Discrete Mathematics Level 2

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

28 8 7 15

View solutions

rocket with vector

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!

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...