Timeline for vertex independent set and the maximal clique
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 29, 2013 at 2:00 | vote | accept | user40096 | ||
| Sep 28, 2013 at 20:04 | answer | added | David Eppstein | timeline score: 4 | |
| Sep 28, 2013 at 17:00 | comment | added | Seva | @user40096: I overlooked the difference between $N$ and $N-1$. My earlier comments removed. | |
| Sep 28, 2013 at 14:42 | comment | added | Flo Pfender | one counter example for $N=2$ would be an odd cycle. For $N\ge 3$, I am not quite sure. | |
| Sep 28, 2013 at 13:58 | comment | added | user40096 | You did not see my question carefully!The maximal degree of $G$ is $N$,but for any $N$-order complete subgraph $H$ of $G$,the degree of every vertex of $H$ is $N$-1. | |
| Sep 28, 2013 at 10:29 | comment | added | user40096 | First,if $I$ is empty,$I$ does not satisfes "for every $N$ -order complete subgraph $H$ of $G$, the intersection of $I$ and $V$($H$) is not empty"!Second,as you said,if the intersection of $I$ and $V$($H$) is empty,how do you know the vertex in $I$ is not adjacent to any vertex of $H$? | |
| S Sep 28, 2013 at 7:25 | history | suggested | Thomas Kahle | CC BY-SA 3.0 |
formatting
|
| Sep 28, 2013 at 7:15 | review | Suggested edits | |||
| S Sep 28, 2013 at 7:25 | |||||
| Sep 28, 2013 at 6:24 | history | asked | user40096 | CC BY-SA 3.0 |