The Inducibility of Graphs on Four Vertices

On sets of acquaintances and strangers at any party

A. W. Goodman · 1959

Earlier work this paper cites.

The maximal number of induced complete bipartite graphs

Béla Bollobás, Chiê Nara, and Shun-ichi Tachibana · 1986

Earlier work this paper cites.

Dense packings of induced subgraphs

Geoffrey Exoo · 1986

Earlier work this paper cites.

The inducibility of complete bipartite graphs

Jason I. Brown and Alexander Sidorenko · 1994

Earlier work this paper cites.

Semidefinite programs and combinatorial optimization

László Lovász · 2003

Earlier work this paper cites.

Limits of dense graph sequences

László Lovász and Balázs Szegedy · 2006

Earlier work this paper cites.

Reflection positivity, rank connectivity, and homomorphism of graphs

Michael Freedman, László Lovász, and Alexander Schrijver · 2007

Cited alongside, same era.

Flag algebras

Alexander A. Razborov · 2007

Cited alongside, same era.

Counting flags in triangle-free digraphs

Original

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

Cited alongside, same era.

Random graphons and a weak positivstellensatz for graphs

László Lovász and Balázs Szegedy · 2009

Cited alongside, same era.

On 3-hypergraphs with forbidden 4-vertex configurations

Alexander A. Razborov · 2010

Cited alongside, same era.

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

Original

Andrzej Grzesik · 2011

Closest in time.

The inducibility of blow-up graphs

Original

Hamed Hatami, James Hirst, and Serguei Norine · 2011

Closest in time.

Non-three-colorable common graphs exist

Original

Hamed Hatami, Jan Hladký, Daniel Král’, Serguei Norine, and Alexander Razborov · 2011

Closest in time.

On the number of pentagons in triangle-free graphs

Original

Hamed Hatami, Jan Hladký, Daniel Král’, Serguei Norine, and Alexander Razborov · 2011

Closest in time.

Undecidability of linear inequalities in graph homomorphism densities

Hamed Hatami and Serguei Norine · 2011

Closest in time.