Timeline for Counting $K_4$ on two graphs sharing the same vertices
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 15, 2020 at 7:27 | history | edited | CommunityBot |
Commonmark migration
|
|
| Oct 21, 2016 at 20:14 | comment | added | D. Ror. | @BenBarber Can you repost your comment as an answer so that the question can be closed? | |
| Aug 31, 2016 at 20:58 | comment | added | jack | @BenBarber Thank you! It was simpler than I thought. | |
| Aug 29, 2016 at 11:57 | comment | added | Ben Barber | If I'm reading the definitions correctly then $G_1$ and $G_2$ differ in at most $M$ edges. Each edge is contained in less that $n^2/2$ $K_4$'s, so the inequality is immediate. | |
| Aug 20, 2016 at 20:44 | comment | added | jack | @Moritz Yes, the subgraphs are induced. | |
| Aug 20, 2016 at 16:13 | comment | added | Moritz | Are the subgraphs in your definition induced? | |
| Aug 20, 2016 at 14:29 | history | asked | jack | CC BY-SA 3.0 |