Timeline for The number of a family of sequences of subsets of $\{1,2,\cdots,n\}$
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 1, 2018 at 17:17 | vote | accept | user173856 | ||
| May 29, 2018 at 20:08 | comment | added | Gerhard Paseman | @Pietro I don't think so, as subsets are allowed to repeat in a sequence. Also, order is important. However, your number might be useful in lower bounds and runtime estimation. Gerhard "Let's Group These Ideas Together" Paseman, 2018.05.29. | |
| May 29, 2018 at 16:36 | comment | added | Pietro Majer | So $W_{n,m}$ is the number of $m$-cliques in the graph $G$, whose vertex set $V(G)$ is the power set of $\{1,2,\dots,n\}$, and $(S,S')\in E(G)$ iff $|S\cap S'|\ge3$ | |
| May 29, 2018 at 16:19 | answer | added | Gerhard Paseman | timeline score: 1 | |
| May 29, 2018 at 15:51 | comment | added | user173856 | Gerhard Paseman: Yes, $S_i$ and $S_j$ are allowed to be equal for $i$ different from $j$. | |
| May 29, 2018 at 15:45 | comment | added | Gerhard Paseman | Are Si and Sj allowed to be equal for I different from j? Is the source of this problem related to counting certain designs (incidence matrices)? Can you provide motivation? Gerhard "Has A Sequence Of Questions" Paseman, 2018.05.29. | |
| May 29, 2018 at 15:44 | history | edited | user173856 | CC BY-SA 4.0 |
edited title
|
| May 29, 2018 at 15:38 | history | asked | user173856 | CC BY-SA 4.0 |