K-RAN
Reputation
Top tag
Next privilege 250 Rep.
8
Impact
~2k people reached

• 0 posts edited

# 25 Actions

 Feb3 awarded Popular Question Nov10 awarded Popular Question Sep24 awarded Autobiographer Oct18 awarded Commentator Oct18 comment What is combinatorics? +1 for an interesting read, Thanks! Feb20 accepted Criticality of a graph Feb14 comment Criticality of a graph I'm going to assume that delta is the degree of any vertex? And is this an actual theorem? Feb13 comment Criticality of a graph A graph is critical if every one of its proper subgraphs (subgraph not equal to the original) has a chromatic color less than the original. Feb13 asked Criticality of a graph Feb13 accepted Proving That A Degree Sequence is Graphical (Havel-Hakami) Feb4 comment Proving That A Degree Sequence is Graphical (Havel-Hakami) Given n = 5, we get K5. Using the method that you described, 3 vertices had to be created, or I could just place 1 vertex on the intersection of 2 of the edges. Pardon my slowness, but I have no idea what this implies... Feb3 comment Proving That A Degree Sequence is Graphical (Havel-Hakami) I don't understand what you mean by "subdivide so edges." Can you elaborate a bit please? Feb3 comment Proving That A Degree Sequence is Graphical (Havel-Hakami) If this is a theorem, I can't use it because I have not learned it yet. Thanks for the suggestion though! Feb3 asked Proving That A Degree Sequence is Graphical (Havel-Hakami) Dec30 awarded Scholar Dec30 awarded Supporter Dec30 accepted Chess Master Problem Dec30 comment Chess Master Problem The problem is that, while working on this problem, my friend wrote a program to figure out all possible schedules that the chess master can make. Not once did a counter example come up (he started with k = 24 or 25). Either way, thanks a lot! This is the explanation that I was looking for. +1 for clearness :D Dec30 awarded Editor Dec30 revised Chess Master Problem added 659 characters in body; deleted 1 characters in body; added 41 characters in body