All Questions

In his book, "The Strange Logic of Random Graphs", Joel Spencer describes the "Dance Marathon" problem: Imagine $n$ couples at a Dance Marathon. Each dance each couple remains ...

I am trying to find the asymptotic behavior of the sum: $$ \sum^n_{i=0} \begin{pmatrix} 2n \\ i \end{pmatrix} x^i y^{2n-i}$$ as $n\rightarrow\infty$. Here $x$, $y$ are complex numbers and I have $|x|...

Turán's theorem says the following. Take any natural $n$ and $r$. Suppose that \begin{equation*} |G|>\Big(1-\frac1r\Big)\frac{n^2}2, \tag{0} \end{equation*} where $|G|$ is the number of edges of ...

$\newcommand{\om}{\omega}$Let $\om(G)$ denote the number of vertices in a largest clique of an (undirected) graph $G$ with the set $[n]:=\{1,\dots,n\}$ of vertices. Then \begin{equation} \om(G)\ge\...

Suppose, $\Xi$ is a collection of random variables. We call $\Xi$ $k$-independent, iff any $k$ distinct elements of $\Xi$ are mutually independent. For example, $2$-independence is pairwise ...

An interesting combinatorial identity is the Vandermonde convolution identity: $$ \sum_k {n\choose k}{m\choose s-k} = {n+m \choose s},$$ which can be proved by considering the coefficients in $(x+1)^{...