| Author | Thread |
|
|
10/18/2012 10:48:26 AM · #17201 |
| Told you I win. 11:00 isn't too early for lunch, so I'll go then. |
|
|
|
10/18/2012 10:51:32 AM · #17202 |
|
|
|
10/18/2012 10:59:07 AM · #17203 |
| Snoozing and eating = two different things. Happy lunch. Eating dinner here. |
|
|
|
10/18/2012 11:03:30 AM · #17204 |
|
|
|
10/18/2012 11:07:30 AM · #17205 |
Raw salmon (heated for 10 seconds under grill) on a bed of Risotto. And master sauce on the salmon. Master sauce I made from scratch with tomato concass (diced meat from tomato after removing skin (by light boiling) and seeds), ginger, spring onion plus a bunch of fresh herbs and 1 part Kikkoman to 2 parts Olive oil.
Mmmmmmmmmm.... |
|
|
|
10/18/2012 11:08:12 AM · #17206 |
| Definitely a meal for champions and fit for the king - Oh yeah that's me. |
|
|
|
10/18/2012 11:09:34 AM · #17207 |
| Sounds great!! 10:00 AM here, have to wait a while for dinner. |
|
|
|
10/18/2012 11:11:41 AM · #17208 |
| Almost time for lunch and nothing taste better than victory. |
|
|
|
10/18/2012 11:33:02 AM · #17209 |
Recall that the chromatic number of a graph G is the least number of colors needed to color the vertices of G in such a way that no two neighbors (vertices joined by an edge) have the same color. We denote the chromatic number of a graph G, X(G).
|
|
|
|
10/18/2012 11:37:25 AM · #17210 |
|
|
|
10/18/2012 11:37:29 AM · #17211 |
|
|
|
10/18/2012 11:47:23 AM · #17212 |
He was so busy with the nerd stuff that he forget to mention anything about winning. Come to think of it, so did all of you. I win!
Message edited by author 2012-10-18 11:47:41. |
|
|
|
10/18/2012 11:48:24 AM · #17213 |
|
|
|
10/18/2012 11:56:51 AM · #17214 |
We also denote the chromatic number of a graph G, X(G),
and win! |
|
|
|
10/18/2012 12:01:27 PM · #17215 |
| Here's some easy math for ya: I win. |
|
|
|
10/18/2012 12:05:09 PM · #17216 |
|
|
|
10/18/2012 12:35:41 PM · #17217 |
but what's 2x2 ?
Spork wins |
|
|
|
10/18/2012 12:51:24 PM · #17218 |
not as wide as a 2X4
!! WIN !! |
|
|
|
10/18/2012 12:53:48 PM · #17219 |
I,m English so there is no doubt that I win.
The Queen says so. |
|
|
|
10/18/2012 01:03:48 PM · #17220 |
Yeah - but that was a tiny win. So it doesn't really count. I win
Besides - go and have some tea :P
Message edited by author 2012-10-18 13:04:09. |
|
|
|
10/18/2012 01:04:04 PM · #17221 |
|
|
|
10/18/2012 01:19:05 PM · #17222 |
Also, recall that a critically k-chromatic graph (k-critical graph, hereinafter) is a k-colored graph G with the property that X(G - v) has chromatic number X(G) - 1 for every vertex v in G. Further, a graph is k-edge connected if at least k edges must be removed to disconnect the graph.
|
|
|
|
10/18/2012 01:22:10 PM · #17223 |
| You should also recall....I win. |
|
|
|
10/18/2012 01:32:49 PM · #17224 |
The limit of Winning as time approaches infinity equals  MarkB |
|
|
|
10/18/2012 02:57:27 PM · #17225 |
Lizard eats paper.
Spork wins. |
|
Home -
Challenges -
Community -
League -
Photos -
Cameras -
Lenses -
Learn -
Help -
Terms of Use -
Privacy -
Top ^
DPChallenge, and website content and design, Copyright © 2001-2025 Challenging Technologies, LLC.
All digital photo copyrights belong to the photographers and may not be used without permission.
Current Server Time: 08/12/2025 10:46:22 AM EDT.
