DPChallenge: A Digital Photography Contest You are not logged in. (log in or register
 

DPChallenge Forums >> General Discussion >> Last wins
Pages:   ... [935] [936] [937] [938] [939] [940] [941] [942] [943] ... [1227]
Showing posts 23451 - 23475 of 30665, (reverse)
AuthorThread
01/04/2014 05:07:04 PM · #23451
Naturally.
01/04/2014 05:07:54 PM · #23452
Spork rhymes with Dork and All rhymes with Fall and that's what you just did. I win again.
01/04/2014 05:10:38 PM · #23453
your bucket's got a hole innit.
01/04/2014 05:11:39 PM · #23454
*kick!*
...no more bucket.
01/04/2014 10:38:30 PM · #23455
art finally kicked the bucket - i win.
say it ain't so and i'll kick yer can.
01/05/2014 12:30:38 AM · #23456
It ain't so, but I just purchased a farm - is that close enough?
01/07/2014 03:51:20 AM · #23457
Hello.
01/07/2014 03:51:39 AM · #23458
Goodbye
01/07/2014 03:51:57 AM · #23459
Originally posted by Art Roflmao:

Hello
01/07/2014 03:54:07 AM · #23460
By the way, as funny as it may sound, I just now realized I was the first player of this game... Hmmph. I guess that means I'm actually the biggest loser (in so many ways) doesn't it? ;)

ETA: And it looks like I've lost a few more than 23,000 times now in fact.

Message edited by author 2014-01-07 03:55:09.
01/07/2014 03:54:40 AM · #23461
Don't think that interrupting my two day streak went unnoticed, Cory. I'm plotting revenge as we speak.
...well not really, I'm eating a salad, but I WILL plot later. Count on it.
01/07/2014 03:56:02 AM · #23462
Originally posted by Art Roflmao:

Don't think that interrupting my two day streak went unnoticed, Cory. I'm plotting revenge as we speak.
...well not really, I'm eating a salad, but I WILL plot later. Count on it.


plot it on the sides of yer toilet.

Salad Shooter!
01/07/2014 03:58:09 AM · #23463
I was first, and I will be last... No other can reign over this domain.
01/07/2014 04:10:31 AM · #23464
Young Josh has a lot to answer for! hojop25
01/07/2014 04:14:21 AM · #23465
Originally posted by Stagolee:

Young Josh has a lot to answer for! hojop25

LOL - Starting this thread was his last post - 2 years ago!
01/07/2014 08:30:04 AM · #23466
Originally posted by Art Roflmao:

Spork rhymes with Dork and All rhymes with Fall and that's what you just did. I win again.


And Art rhymes with Fart

Spork wins
01/11/2014 03:14:33 AM · #23467
nothing rhymes with Claudia
01/11/2014 11:40:31 AM · #23468
Originally posted by the99:

nothing rhymes with Claudia

Unless I applaud ya.

But I can't because you lose and I win. :P
01/11/2014 04:20:40 PM · #23469
Applause, applause, applause. I found a place at DPChallenge where I can declare - I win!

Can I have a ribbon?
01/13/2014 10:53:08 AM · #23470
Hi. Sorry for my absence. I've been thinking a lot about the next problem, and I finally cracked it last night during a fitful sleep. Given k >= 0, let P_k denote the family of all k-degenerate graphs, and for some graph G, let X_(P_k)(G) represent the minimum number of partitions of the vertices of V(G) necessary for each partition to induce a k-degenerate subgraph of G. A graph G is said to be l-critical with respect to X_(P_k) if X_(P_k)(G) = l but X_(P_k)(G - v) = l - 1 for every v in G. I intend to show that d(G) >= (k + 1)(l - 1).
01/13/2014 11:00:45 AM · #23471
Best of luck with your intentions.

In more important matters, Spork wins.

And builds a garden robot.
01/14/2014 03:11:42 PM · #23472
I lost my fifteen minutes of fame and applause. bad luck !
01/14/2014 04:04:59 PM · #23473
You've had almost an hour...

The stage and the victory belong to Spork.

Spork wins.
01/14/2014 04:50:16 PM · #23474
Originally posted by bvy:

Hi. Sorry for my absence. I've been thinking a lot about the next problem, and I finally cracked it last night during a fitful sleep. Given k >= 0, let P_k denote the family of all k-degenerate graphs, and for some graph G, let X_(P_k)(G) represent the minimum number of partitions of the vertices of V(G) necessary for each partition to induce a k-degenerate subgraph of G. A graph G is said to be l-critical with respect to X_(P_k) if X_(P_k)(G) = l but X_(P_k)(G - v) = l - 1 for every v in G. I intend to show that d(G) >= (k + 1)(l - 1).


Wow, no one caught that. The last statement is unqualified. It should read:

I intend to show that if G is l-critical with respect to X_(P_k) then d(G) >= (k + 1)(l - 1).
01/17/2014 01:11:19 AM · #23475
I come back to win?

Message edited by author 2014-01-17 01:11:38.
Pages:   ... [935] [936] [937] [938] [939] [940] [941] [942] [943] ... [1227]
Current Server Time: 08/09/2025 12:35:51 PM

Please log in or register to post to the forums.


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/09/2025 12:35:51 PM EDT.