Search results for combinatorics

1 votes
1 answer
2
0 votes
1 answer
3
Prove that the number of edges in a graph with exactly one triangle is at most \begin{align*} \frac{\left( n - 1 \right )^2}{4} + 2\end{align*}
0 votes
1 answer
4
Consider the sets $A_1, A_2, A_3 \dots A_m$. Prove that the number of distinct sets of the form $A_i \oplus A_j$ is at least $m$.
0 votes
0 answers
5
Consider the sets $A_1, A_2, A_3 \dots A_m$ each a subset of size $k$ of $\{1,2,3, \dots , n\}$. If in a 2-colouring of $\{1,2,3, \dots , n\}$ no set $A_i$ is monoch...
0 votes
0 answers
8
Prove for a positive integer valued random variable, $X$ , and for positive integers $a < b$\begin{align*} &P(X \geq b) \leq \left [ \left ( \frac{E(X)}{b} \right ) - P(...
To see more, click for the full list of questions or popular tags.