Timeline for Show that if $G$ is simple a graph with $n$ vertices and the number of edges $m>\binom{n-1}{2}$, then $G$ is connected.
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 23, 2023 at 21:02 | history | edited | RobPratt | edited tags | |
| Apr 13, 2017 at 12:20 | history | edited | CommunityBot | replaced http://math.stackexchange.com/ with https://math.stackexchange.com/ | |
| May 6, 2016 at 1:09 | history | edited | user5826 | CC BY-SA 3.0 | edited title |
| Apr 24, 2013 at 18:54 | history | edited | Gautam Shenoy | CC BY-SA 3.0 | Corrected spelling of one of the authors. |
| Nov 11, 2012 at 7:53 | comment | added | kahen | I think the title of your question would've been better as "Is a graph $G=(V,E)$ with $|E| > \binom{|V|-1}2$ connected?" | |
| Apr 21, 2011 at 2:06 | vote | accept | yunone | ||
| Apr 21, 2011 at 1:56 | answer | added | Gerry Myerson | timeline score: 14 | |
| Apr 21, 2011 at 1:49 | history | asked | yunone | CC BY-SA 3.0 |