# Clique containment

## Definition

Let $N \gt 0$ be an integer, and and $n = N \choose 2$ the number of possible edges in a graph with $N$ vertices. In this way, every $x \in \{-1,1\}^n$ describes a graph on $N$ vertices, with $x_i = 1$ if and only if the $i$-th edge appears in the graph.

Let $k \gt 0$ be an integer. The k-clique containment function is the function $f_k : \{-1,1\}^n \to \{-1,1\}$ such that $f_k(x) = 1$ if and only if the graph described by $x$ contains a clique of size $k$.

For a fixed value of $k$, as $n \to \infty$, the function $f_k(x)$ almost always takes the value $1$. Thus $k$ must grow with $n$; as it turns out, the proper scaling (that doesn't make $f_k(x)$ degenerate) is $k \approx \log(n)$ [TODO: Cite]. Sometimes the phrase "clique containment" refers to the function $f_k$ for this specific choice of $k$.

Note: Even for the choice of $k$ above, the function $f_k(x)$ is non-degenerate only for some sequence of $n$.

## References

1. Problem I.9 in Noise Sensitivity of Boolean functions and Percolation by C. Garban and J. Steif (2014).
2. Proposition VIII.10 in Noise Sensitivity of Boolean functions and Percolation by C. Garban and J. Steif (2014).