network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 2 years, 4 months |
| seen | Jul 29 '12 at 1:41 | |
| stats | profile views | 11 |
Math & CS Student, aspiring to be...a decent programmer.
...Actually, I just enjoy this stuff a lot. Aspirations [easily] put aside, I just want to have fun! :D
|
Oct 18 |
awarded | Commentator |
|
Oct 18 |
comment |
What is combinatorics? +1 for an interesting read, Thanks! |
|
Feb 20 |
accepted | Criticality of a graph |
|
Feb 14 |
comment |
Criticality of a graph I'm going to assume that delta is the degree of any vertex? And is this an actual theorem? |
|
Feb 13 |
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. |
|
Feb 13 |
asked | Criticality of a graph |
|
Feb 13 |
accepted | Proving That A Degree Sequence is Graphical (Havel-Hakami) |
|
Feb 4 |
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... |
|
Feb 3 |
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? |
|
Feb 3 |
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! |
|
Feb 3 |
asked | Proving That A Degree Sequence is Graphical (Havel-Hakami) |
|
Dec 30 |
awarded | Scholar |
|
Dec 30 |
awarded | Supporter |
|
Dec 30 |
accepted | Chess Master Problem |
|
Dec 30 |
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 |
|
Dec 30 |
awarded | Editor |
|
Dec 30 |
revised |
Chess Master Problem added 659 characters in body; deleted 1 characters in body; added 41 characters in body |
|
Dec 30 |
comment |
Chess Master Problem Of course he would have played at least 22 games after 22 days. You can't guarantee that, regardless of his regiment, he will have played EXACTLY 22 games after 22 days though... |
|
Dec 30 |
comment |
Chess Master Problem I meant to ask for a proof for any k >= 22 over a span of any number of consecutive days. So in other words, prove/dis-prove that no matter how the chess master arranges his practice regiment, there will always be a consecutive sequence of days where he plays a total of k hours, k >= 22. Sorry for the confusion! |
|
Dec 30 |
awarded | Student |
