Prove you're not a brainlet and prove that it is possible to colour a dodecahedron's edges with 3 colours so that
1. Three edges of the same colour form a line going through two vertices.
2. That line then cannot meet with any more with lines of the same colour.
Having bad grammar in a math problem is kind of a problem. I'm not even sure what you're trying to ask.
>That line then cannot meet with any more with lines of the same colour.
>with any more with
>>9105179
>t.1st year CS undergrad trying to bait answer for his homework
>>9105179
>Prove you're not a brainlet
You have to stop wording your homework questions like this. We can smell it from a mile away that you're just trying to get a quick answer out of his. Maybe if ask real nicely we will help you, brainlet.
>>9105179
Prove it is possible? Just draw one example. Your homework is not that hard.
>>9105179
Here I did your HW for you OP.
I now present this thread with a more interesting problem:
Is it possible to color the graph shown in such a way that proves that OP is a faggot?
>>9105495
proof that OP is a faggot is trivial and left as a problem for the reader