Logic of binomial random graphs

In the talk, we will focus on graph properties that can be expressed in terms of first order and second order logics. For example, the properties of contating a triangle and being complete are of first order, and the properties of being connected and having even number of vertices are of second order. Probabilities of such properties (for the binomial, or Erdos-Renyi, random graph) are of interest since 1960 when the seminal paper of Erdos and Renyi was published. In 2001, J. Spencer reviewed known results concerning first order properties of random graphs in his survey "Strange logic of random graphs". A classic result in the area called "zero-one law" states that a probability of either first-order property approaches 0 or 1. This result was proved in 1969 by Glebskii, Kogan, Liogon'kii and Talanov (and independently by Fagin in 1976). Since 2001, many results concerning both first order and second order properties were obtained. There is a number of nice conjectures that are still open.