Timeline for Any results concerning the numbers of vertices and edges to form fixed number of cliques in $K_n$?
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 14, 2020 at 19:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Sep 16, 2019 at 19:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| May 19, 2019 at 18:02 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Apr 19, 2019 at 17:36 | history | edited | Connor | CC BY-SA 4.0 |
added 39 characters in body
|
| Apr 19, 2019 at 17:23 | history | edited | Connor | CC BY-SA 4.0 |
Change the typo $k(n)$ to $t(n)$
|
| Apr 19, 2019 at 4:32 | comment | added | Aaron Meyerowitz | See below. What you can say when $b=\binom{a}{2}$ is that $\frac{a(a-1)}{s(s-1)} \leq t \leq \binom{a}{s}.$ Both extremes are possible. | |
| Apr 19, 2019 at 3:57 | answer | added | Aaron Meyerowitz | timeline score: 1 | |
| Apr 18, 2019 at 22:31 | comment | added | Connor | @RobertIsrael I mean they come from an $a$-vertex clique which satisfies $t$ is around $\binom{a}{s}$, so they “intersect” a lot. | |
| Apr 18, 2019 at 22:28 | comment | added | Robert Israel | I don't understand. You just said they do come from a larger clique, namely $K_n$. | |
| Apr 18, 2019 at 15:20 | review | Close votes | |||
| Apr 22, 2019 at 15:57 | |||||
| Apr 18, 2019 at 14:51 | history | asked | Connor | CC BY-SA 4.0 |