Timeline for Proving edge connectivity
Current License: CC BY-SA 3.0
6 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
S Sep 24, 2013 at 16:29 | history | suggested | Sergiy Kozerenko | CC BY-SA 3.0 |
TeX changes
|
Sep 24, 2013 at 16:05 | review | Suggested edits | |||
S Sep 24, 2013 at 16:29 | |||||
May 15, 2010 at 19:30 | answer | added | Tony Huynh | timeline score: 2 | |
May 15, 2010 at 12:28 | comment | added | lardydah | Sorry - I actually thought about putting the definitions in but forgot! Kappa is the smallest k for which G has a k-cut. Lambda is the smallest k for which G has a k-edge cut. Delta is the smallest degree in G. | |
May 15, 2010 at 12:27 | comment | added | Tom Smith | What are Kappa, Lambda and Delta? | |
May 15, 2010 at 12:23 | history | asked | lardydah | CC BY-SA 2.5 |