Universality of graphs with few triangles and anti-triangles Mykhaylo Tyomkyn Call a graph sequence 3-random-like if it contains asymptotically the same number of triangles and empty 3-sets as the random graph Gn,1 2 . T - Universality - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-03-10 06:16:16		Universality of graphs with few triangles and anti-triangles Mykhaylo Tyomkyn Call a graph sequence 3-random-like if it contains asymptotically the same number of triangles and empty 3-sets as the random graph Gn,1/2 . T Add to Reading List Source URL: web.mat.bham.ac.uk Download Document from Source Website File Size: 15,70 KB Share Document on Facebook