Given a graph $G$, we can form a hypergraph $H$ whose edges correspond to the triangles in $G$. If $G$ is the standard Erdős-Rényi random graph with independent edges, then $H$ is random, but its edges are not independent, because of overlapping triangles. This is (presumably!) a major complication when proving results about triangles in random graphs.  However, it turns out that, for many purposes, we can treat the triangles as independent, in a one-sided sense (and losing something in the density): we can find an independent random hypergraph within the set of triangles. I will present two proofs, one of which generalizes to larger complete (and some non-complete) subgraphs.

Any four dimensional N=2 superconformal field theory (SCFT) contains a subsector of local operator which is isomorphic to a two dimensional chiral algebra.  If the 4d theory possesses N= 4 superconformal symmetry, the corresponding chiral algebra is an extension of the (small) N=4 super-Virasoro algebra.  In this talk I  will present some results on the classification of N=4 chiral algebras and discuss the conditions they should satisfy in order to correspond to a 4d theory.