meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 2 years |
| seen | May 14 at 21:51 | |
| stats | profile views | 30 |
|
May 1 |
comment |
Proof for Singularity of Additive Identity @user6981: I believe I was a bit more generous than that. Besides, Apostol isn't giving a better explanation of that proof; he's giving a different one. |
|
May 1 |
comment |
Proof for Singularity of Additive Identity I know he doesn't say explicitly say this is the only way to prove it, but he does repeatedly emphasize the dependence on the cancellation laws. I just wanted confirmation that I wasn't missing something. |
|
May 1 |
comment |
Proof for Singularity of Additive Identity Strangely, Apostol seems to emphasize that the exclusivity of $0$ depends on the Cancellation Law. |
|
May 1 |
comment |
Proof for Singularity of Additive Identity So is the alternative proof indeed valid? |
|
May 1 |
awarded | Commentator |
|
May 1 |
comment |
Proof for Singularity of Additive Identity Federica: Apostol assumes the Commutative law and treats $0$ as both-side neutral. |
|
May 1 |
asked | Proof for Singularity of Additive Identity |
|
Feb 13 |
awarded | Yearling |
|
Feb 8 |
awarded | Popular Question |
|
Jan 25 |
awarded | Teacher |
|
Mar 6 |
answered | Name of a 6 vertices graph |
|
Mar 6 |
answered | Show that a graph G cannot exist with vertices of the given degree |
|
Mar 6 |
comment |
Degree Sequence of a Graph The problem you are referring to is known as the handshaking lemma. |
|
Mar 6 |
answered | Proving That A Degree Sequence is Graphical (Havel-Hakami) |
|
Feb 29 |
answered | Proof that any simple connected graph has at least 2 non-cut vertices. |
|
Aug 23 |
accepted | Understanding the Proof of Dirac's Theorem Regarding Graph Connectivity |
|
Aug 23 |
awarded | Editor |
|
Aug 23 |
revised |
Understanding the Proof of Dirac's Theorem Regarding Graph Connectivity added 60 characters in body |
|
Aug 23 |
asked | Understanding the Proof of Dirac's Theorem Regarding Graph Connectivity |
|
Aug 14 |
comment |
Proof for Menger's Theorem Why the emphasis on maximum number of internally disjoint uv-paths? The proof of the theorem seems to indicate that there are exactly k internally disjoint uv-paths. |
