Timeline for Clique numbers of chordal graphs
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 3, 2016 at 4:09 | vote | accept | gondolier | ||
| Nov 3, 2016 at 4:08 | vote | accept | gondolier | ||
| Nov 3, 2016 at 4:09 | |||||
| Oct 30, 2016 at 3:59 | comment | added | gondolier | Thank you very much. In an attempt to consider what subgraph count identities might hold for k-chordal graphs (k=3 for chordal), I found the PEO property is extended here: sciencedirect.com/science/article/pii/S0012365X13003877 which basically says the neighbors among the previous vertices are within distance k-2 of each other. It seems if we replace c_i by the numbers of i-cliques in G^{k-2}, the same argument does NOT go through, and I am not sure what are the correct subgraph counts to look at here. | |
| Oct 30, 2016 at 3:47 | vote | accept | gondolier | ||
| Oct 30, 2016 at 3:47 | |||||
| Oct 28, 2016 at 21:30 | history | answered | Richard Stanley | CC BY-SA 3.0 |