Timeline for number of connected subgraphs of $G$ with at most $ k>0$ vertices
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 28, 2018 at 15:01 | vote | accept | ms_stud | ||
| Jan 28, 2018 at 12:59 | answer | added | Yuval Filmus | timeline score: 3 | |
| Jan 27, 2018 at 9:50 | comment | added | ms_stud | I tried to think about this one but the problem is that d can be much smaller than k ( $d<k$ ) | |
| Jan 27, 2018 at 8:36 | comment | added | ms_stud | I mean connected subgraphs that is subset of the vertices and the edges between them which makes a connected graph of size $k$ | |
| Jan 27, 2018 at 5:17 | history | asked | ms_stud | CC BY-SA 3.0 |