Timeline for The maximal number of copies of a graph $T$ in an $H$-free graph
Current License: CC BY-SA 4.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 27, 2018 at 8:04 | history | edited | Lviv Scottish Book | CC BY-SA 4.0 |
Added a link
|
| Oct 21, 2018 at 20:56 | history | edited | Lviv Scottish Book | CC BY-SA 4.0 |
added 35 characters in body
|
| Oct 2, 2017 at 20:11 | history | edited | Lviv Scottish Book | CC BY-SA 3.0 |
added 16 characters in body
|
| Oct 2, 2017 at 20:09 | comment | added | Lviv Scottish Book | @IlyaBogdanov You are right. Then to make the question non-trivial, I will add the assumption that $H$ is not a subgraph of $T$. | |
| Oct 2, 2017 at 8:57 | comment | added | Ilya Bogdanov | Replacing by $\mathbb N\cup\{0\}$ does not help, since $1\neq\Omega(0)$; you need $-\infty$ instead of $0$... | |
| Oct 2, 2017 at 8:55 | history | edited | Lviv Scottish Book | CC BY-SA 3.0 |
added 13 characters in body
|
| Oct 1, 2017 at 17:46 | comment | added | Lviv Scottish Book | @MikhailTikhomirov To exclude the counterexample of Tikhomirov, I replaced the set $\mathbb N$ by $\omega:=\mathbb N\cup\{0\}$. | |
| Oct 1, 2017 at 17:45 | history | edited | Lviv Scottish Book | CC BY-SA 3.0 |
Replaced $\mathbb N$ by $\omega$
|
| Sep 30, 2017 at 19:43 | comment | added | Lviv Scottish Book | @SamHopkins Concerning omitted assumptions, rewriting the problem to MathOverFlow, I give a link to the scan of the page where the original problem is written. Sometimes I add the necessary definitions (when I understand the problem). Of course, posting a problem on MathOverFlow is much more responsible comparing to writing it in the Lviv Scottish Book where it remains basically unnoticed. After posting the problem to MathOverFlow I communicate with the authors of the problem requiring to react and comment to the answers. And it eventually works. | |
| Sep 30, 2017 at 19:39 | history | edited | Lviv Scottish Book | CC BY-SA 3.0 |
[Edit removed during grace period]
|
| Sep 30, 2017 at 19:15 | history | edited | Taras Banakh | CC BY-SA 3.0 |
Added the assumption that $H$ is a tree.
|
| Sep 30, 2017 at 15:03 | comment | added | Sam Hopkins | The questions posted by this account are indeed interesting, but it seems like sometimes they are missing key assumptions, because the person posting the question to MO is not the same as the one who originally thought of the question. I wonder if there is a better method for publicizing these questions. | |
| Sep 30, 2017 at 13:12 | comment | added | Clara Sh | N.B.: $H$ is supposed to be a tree, otherwise it is indeed well known. | |
| Sep 30, 2017 at 11:30 | answer | added | Ilya Bogdanov | timeline score: 7 | |
| Sep 30, 2017 at 10:22 | comment | added | Mikhail Tikhomirov | If $H$ is a subgraph of $T$, then $ex(n, T, H) = 0$ for all $n$, which is not $\Theta(n^k)$ for any $k$. | |
| Sep 30, 2017 at 8:59 | history | asked | Lviv Scottish Book | CC BY-SA 3.0 |