On the Number of Pentagons in Triangle-Free Graphs

Operations with structures

László Lovász · 1967

Earlier work this paper cites.

On some problems in graph theory, combinatorial analysis and combinatorial number theory

Paul Erdős · 1984

Earlier work this paper cites.

How to make a graph bipartite

Paul Erdős, Ralph Faudree, János Pach, and Joel Spencer · 1988

Earlier work this paper cites.

On the number of C 5 C_{5} ’s in a triangle-free graph

Ervin Győri · 1989

Earlier work this paper cites.

On the edge distribution in triangle-free graphs

Michael Krivelevich · 1995

Earlier work this paper cites.

Graphs and Homomorphisms

Pavol Hell and Jaroslav Nešetřil · 2004

Earlier work this paper cites.

Sparse halves in triangle-free graphs

Peter Keevash and Benny Sudakov · 2006

Cited alongside, same era.

Flag algebras

Alexander A. Razborov · 2007

Cited alongside, same era.

Convergent sequences of dense graphs. I. Subgraph frequencies, metric properties and testing

Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, and Katalin Vesztergombi · 2008

Cited alongside, same era.

On the minimal density of triangles in graphs

Alexander A. Razborov · 2008

Cited alongside, same era.

Counting flags in triangle-free digraphs

Original

Jan Hladký, Daniel Král, and Serguei Norine · 2009

Cited alongside, same era.

On 3-hypergraphs with forbidden 4-vertex configurations

Alexander A. Razborov · 2010

Later among the works it cites.

Cycles of length 5 in triangle-free graphs: A sporadic counterexample to a characterization of equality

T. S. Michael · 2011

Closest in time.

On the Fon-der-Flaass interpretation of extremal examples for Turan’s (3,4)-problem

Alexander A. Razborov · 2011

Closest in time.

On the maximum number of five-cycles in a triangle-free graph

Andrzej Grzesik · 2012

Closest in time.

Large networks and graph limits

László Lovász · 2012

Closest in time.