## Long increasing subsequences and large homogenous subsets

The length of the longest increasing subsequence in a random permutation and the size of the largest homogeneous set (i.e. a clique or an independent set) in a random graph are two of the classical problems at the interface of combinatorics and probability theory, with connections to several other areas of mathematics. In this paper, …

Long increasing subsequences and large homogenous subsetsRead More »