Highly Influenced

# Undecidability of Linear Inequalities in Graph Homomorphism Densities

@inproceedings{Norine2011UndecidabilityOL, title={Undecidability of Linear Inequalities in Graph Homomorphism Densities}, author={Serguei Norine}, year={2011} }

- Published 2011

Many fundamental theorems in extremal graph theory can be expressed as algebraic inequalities between subgraph densities. As is explained below, for dense graphs, it is possible to replace subgraph densities with homomorphism densities. An easy observation shows that one can convert any algebraic inequality between homomorphism densities to a linear inequality. Inspired by the work of Freedman, Lovász and Schrijver [FLS07], in recent years a new line of research in the direction of treating and… CONTINUE READING