Timeline for Expected Number of edges for a graph to have a Triangle?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 28, 2016 at 14:00 | comment | added | MR_BD | Thank you... sorry , the code is not good looking | |
| Aug 28, 2016 at 13:47 | vote | accept | MR_BD | ||
| Aug 28, 2016 at 13:45 | comment | added | fedja | @BD Yes, that was a typo :-). I edited. As to the code, I ran the simulations myself and got the result quite close to 4/5 starting with 20 or so (if anything, it was typically above 4/5 for small $n$ rather than below). So you definitely have an error. You should detect some non-existing triangles somewhere. If you want, you can post the code and I'll take a look. | |
| Aug 28, 2016 at 13:41 | history | edited | fedja | CC BY-SA 3.0 |
deleted 1 character in body
|
| Aug 28, 2016 at 12:20 | comment | added | MR_BD | Are you sure that $T=\frac{(2kn)^3}{6}$ ? i think $n$ must be Canceled... | |
| Aug 28, 2016 at 12:18 | comment | added | MR_BD | i Checked my Code and i didn't found any fault... is it possible that $|V|=300$ is not enough to reach 0.8 ? | |
| Aug 28, 2016 at 12:17 | comment | added | MR_BD | Thanks for this brilliant idea... is there any other idea to deal with problems like this? the MinMax trick was awesome... can you remember some other problem that solved with that? | |
| Aug 28, 2016 at 10:47 | history | answered | fedja | CC BY-SA 3.0 |