Timeline for Clique numbers of chordal graphs
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 1, 2021 at 21:52 | comment | added | okw1124 | I thought that since the distance between any two vertices in $N(v)$ is $1$, $N(v)$ makes a clique. Did I miss something? | |
| Nov 1, 2021 at 21:15 | comment | added | Fedor Petrov | @okw1124 $N(v)$ is not a clique, but any clique containing $v$ has a form "$v$ plus some clique in $N(v)-v$", and viceversa | |
| Nov 1, 2021 at 20:17 | comment | added | okw1124 | Intuitively, I understood that adding $v$ makes $(r-1)$-cliques in $G[N(v)-v]$ to $r$-cliques in $G$. But how can I prove this concretely? Should I focus on the fact that $N(v)$ makes a clique, and adding $v$ to $N(v)$ makes a clique with one more vertex? | |
| Nov 1, 2021 at 20:14 | comment | added | Fedor Petrov | @okw1124 I have brief explanations for all three summands, which of them needs to be explained more? | |
| Nov 1, 2021 at 19:37 | comment | added | okw1124 | It maybe too late, but can you explain $s(G)=s(G-v)-s(G[N(v)-v])+1$ part little bit more? | |
| Nov 3, 2016 at 4:09 | vote | accept | gondolier | ||
| Nov 3, 2016 at 4:09 | |||||
| Oct 28, 2016 at 21:17 | history | answered | Fedor Petrov | CC BY-SA 3.0 |