1. On the number of maximal independent sets in graphs from hereditary classes;Alekseev,1991
2. Neighborly families of boxes and bipartite coverings;Alon;Algorithms Combin.,1997
3. N. Alon, I. Haviv, private communication.
4. K. Amano, Some improved bounds on communication complexity via new decompositions of cliques (2012). Preprint http://www.cs.gunma-u.ac.jp/~amano/paper/clique.pdf.
5. Random Graphs;Bollobas,2001