audiFanatic
Reputation
384
Top tag
Next privilege 500 Rep.
Access review queues
 Mar 31 accepted number of edges in the complement of a complete bipartite graph as a function of $n$, the toal number of verticies Mar 31 revised number of edges in the complement of a complete bipartite graph as a function of $n$, the toal number of verticies edited title Mar 31 comment number of edges in the complement of a complete bipartite graph as a function of $n$, the toal number of verticies Ah, I just caught that now after reading my question again. Typo, my apologies. $n$ is the number of vertices, not edges Mar 31 revised number of edges in the complement of a complete bipartite graph as a function of $n$, the toal number of verticies added 4 characters in body Mar 31 comment number of edges in the complement of a complete bipartite graph as a function of $n$, the toal number of verticies correct, I understand that, but $n$ is the total number of vertices, which is still $p+q$ Mar 31 comment number of edges in the complement of a complete bipartite graph as a function of $n$, the toal number of verticies how can $pq=n$? isn't $n= p+q$? Mar 31 asked number of edges in the complement of a complete bipartite graph as a function of $n$, the toal number of verticies Mar 31 comment Expectation of a Poisson Process Right up top, unless I'm missing something, first one. Can't miss it. They use X and Y there rather than W Mar 31 accepted Prove for a simple graph that $n-1 \leq m \leq \frac{n(n-1)}{2}$ Mar 30 comment Prove for a simple graph that $n-1 \leq m \leq \frac{n(n-1)}{2}$ exactly, that's what I'm not sure about. I can show that the other extreme is true as well by removing any $3$ edges. Removing any more than that makes the graph disconnected and the inequality would fail. However, I'm not exactly sure that showing this for the extreme cases would be considered a "proof" Mar 30 comment Prove for a simple graph that $n-1 \leq m \leq \frac{n(n-1)}{2}$ 0oo, I didn't know I could use MathJax in titles too. thanks for the fix and teaching me something new Mar 30 asked Prove for a simple graph that $n-1 \leq m \leq \frac{n(n-1)}{2}$ Mar 30 comment Expectation of a Poisson Process I did, I'm not quite understanding. as far as I can tell from wikipedia, the inner function would be a function of $x$ en.wikipedia.org/wiki/Law_of_total_expectation Mar 30 comment Expectation of a Poisson Process @Did Maybe it's a notation thing, this subject has a lot of different notations, but the inner expectation should be a function of $x$ and the outer one should turn it into a number, correct? Mar 27 revised Expectation of a parallel system added 3 characters in body Mar 27 comment Expectation of a parallel system What is $H_n$, the heavyside step function? Mar 27 revised Expectation of a parallel system added 61 characters in body Mar 27 asked Expectation of a parallel system Mar 27 comment Conditioning on a random variable of course that only works if $\Lambda$ and $X$ are independent Mar 27 comment Conditioning on a random variable No, thank you! Between both answers I think I've got this well understood now. I hate to have to pick just one of them as best because they were kinda complementary in helping me out