Georgia Institute of Technology College of Sciences

In this talk we show how to obtain some (sometimes sharp) inequalities between subgraph densities which are valid asymptotically on any sequence of finite simple graphs with an increasing number of vertices. In order to do this we codify a simple graph with its edge monomial and establish a nice graphical notation that will allow us to play around with these densities.