0 votes 0 votes What is the minimal number K such that there exists a proper edge coloring of the complete graph on 8 vertices with K colors? A) 28 B) 8 C) 7 D) 15 Graph Theory graph-theory edge-coloring + – Lakshman Bhaiya asked Jun 1, 2018 Lakshman Bhaiya 1.5k views answer comment Share Follow See 1 comment See all 1 1 comment reply Mk Utkarsh commented Jun 1, 2018 reply Follow Share answer is 7. Not a formal proof but there can be 7 sets of 4 edges disjoint to each other. total number of edges = 28 then 7 colors are needed. https://en.wikipedia.org/wiki/Edge_coloring#/media/File:Complete-edge-coloring.svg 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes Answer will be 7, I have drawn a partial diagram it will help to visualise, numbers represent colours Rishav Kumar Singh answered Aug 20, 2018 Rishav Kumar Singh comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Answer will be 7 Anurag Parothia 1 answered Aug 20, 2018 Anurag Parothia 1 comment Share Follow See all 0 reply Please log in or register to add a comment.