At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
omg graph theory is cool let me think
have you ever heard of the degree sequence algorithm
Write it in decreasing order
Should be no, since 2 of the vertices are connected to every other vertex. Why is this a contradiction?
(5,5,4,2,2,1) since 5 is the first number, the algorithm says to remove it and take 1 away from the 5 numbers after
yes you are correct bond
repeat the algorithm
rings a bell myin, go with that one for the proof, but it's good to understand why
4 is the first number now take 1 away from the four numbers after is and you get (2,0,0,-1) but you cant have a vertice with degree 1
so there is no simple graph with (5,5,4,2,2,1)
it is good to understand why, but I never knew why lol i don;t think
I just meant for this problem which has a simple contradiction, I don't think I could do it if it got any more complex.
Do you know if the algorithm always works? I don't remember.
as long as you dont have mixed graphs
Also, sorry fort butting in :-[
why? remember i like your number theory style so i think you are cool