meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 8 months |
| seen | Dec 9 '12 at 2:34 | |
| stats | profile views | 5 |
|
Dec 9 |
comment |
graph theory /combinatorics committee existence ok thanks brian, so just to conclude is it safe to say By maximality of C, c0 ā ck can be expressed as a finite set of vertices with edges connected to only vāV, which proves the 2 properties |
|
Dec 9 |
awarded | Scholar |
|
Dec 9 |
accepted | graph theory /combinatorics committee existence |
|
Dec 9 |
comment |
graph theory /combinatorics committee existence I don't understand how v ā V, {v} is trivially independent since there is a possibility of that all vertices are joined by an edge. |
|
Dec 8 |
comment |
graph theory /combinatorics committee existence Brian, is there a formal proof I can do some reading on for the above steps? |
|
Dec 8 |
awarded | Student |
|
Dec 8 |
asked | graph theory /combinatorics committee existence |
