We discuss a particular method of constructing graphs having many edges and no small cycles. The adjacency relations in these graphs are defined by certain systems of polynomial equations over finite fields. We survey some old and new results about these graphs and mention some open problems.