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	Meta Content
	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 Document Date: 2014-03-10 06:16:16 Open Document File Size: 15,70 KB Share Result on Facebook

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 . TAdd to Reading List