| Author | Thread |
|
|
10/20/2013 01:31:56 PM · #23126 |
| Spork should stay on the shelf and collect dust. |
|
|
|
10/20/2013 04:44:53 PM · #23127 |
|
|
|
10/20/2013 05:33:26 PM · #23128 |
|
|
|
10/20/2013 07:24:51 PM · #23129 |
Spork is not restrained by your creations.
Spork wins. Always. |
|
|
|
10/20/2013 10:50:50 PM · #23130 |
Then Spork is restrained by my restraints.
 |
|
|
|
10/21/2013 03:07:29 PM · #23131 |
|
|
|
10/21/2013 03:57:38 PM · #23132 |
Spork likes it when Art plays kinky.
Spork wins |
|
|
|
10/21/2013 05:05:55 PM · #23133 |
Too bad Art forgot the safe word. RIP, Spork.
 |
|
|
|
10/21/2013 08:24:13 PM · #23134 |
Spork plays rough...no safe word needed.
Spork wins. |
|
|
|
10/21/2013 11:15:48 PM · #23135 |
|
|
|
10/22/2013 04:40:27 AM · #23136 |
|
|
|
10/22/2013 01:20:07 PM · #23137 |
Spork can play nicey nice too
Sprok wins |
|
|
|
10/22/2013 08:02:04 PM · #23138 |
| That's very admirable, Mr. Sprok. |
|
|
|
10/22/2013 09:03:57 PM · #23139 |
Sprok is Spork's cousin.
Spork wins.
Like Art, Sprok only wins in his dreams. |
|
|
|
10/22/2013 11:19:09 PM · #23140 |
|
|
|
10/23/2013 08:03:17 AM · #23141 |
He will...Sprok went for a little ride.
Sprok didn't come back.
Spork wins |
|
|
|
10/23/2013 11:19:44 AM · #23142 |
| now is the time on Sprokets when when we dance |
|
|
|
10/23/2013 12:01:05 PM · #23143 |
when the when whens come out you know you have lost it.
I win. |
|
|
|
10/23/2013 12:20:13 PM · #23144 |
Originally posted by Tiny:
I win. |
when |
|
|
|
10/23/2013 01:10:14 PM · #23145 |
Recall that a graph G is k-degenerate if every induced subgraph H of G has d(H) <= k. A graph has degeneracy k if it is k-degenerate but not (k-1)-degenerate. Trees and forests (graphs containing no cycles) have degeneracy 1. All planar graphs are 5-degenerate, although a planar graph can have degeneracy less than 5 (e.g. trees are planar).
A k-degenerate graph G is maximal k-degenerate if for any two non-adjacent vertices u, v of G, the graph G+uv is not k-degenerate.
I would like to prove that if G is a maximal k-degenerate graph of order n >= k+1, then d(G) = k.
|
|
|
|
10/23/2013 02:46:07 PM · #23146 |
Spork laments this has degenerated into a math class.
Spork dances.
Spork wins |
|
|
|
10/23/2013 03:20:12 PM · #23147 |
| I am sure K is not a degenerate...He is nice! |
|
|
|
10/23/2013 04:00:24 PM · #23148 |
|
|
|
10/23/2013 07:27:41 PM · #23149 |
|
|
|
10/23/2013 08:28:39 PM · #23150 |
K is not only a degenerate, K is a good for nothing layabout.
Spork wins.
K loses |
|
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 01:10:42 AM EDT.
