Undecidability of Linear Inequalities in Graph Homomorphism Densities

@inproceedings{Norine2011UndecidabilityOL,
  title={Undecidability of Linear Inequalities in Graph Homomorphism Densities},
  author={Serguei Norine},
  year={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
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Introduction to quadratic forms over fields

  • T. Y. Lam
  • Graduate Studies in Mathematics,
  • 2005
1 Excerpt

Positive polynomials, Springer Monographs in Mathematics, Springer-Verlag, Berlin, 2001, From Hilbert’s 17th problem to real algebra

  • Alexander Prestel, Charles N. Delzell
  • 2002

Relations between sets of complete subgraphs

  • Béla Bollobás
  • Proceedings of the Fifth British Combinatorial…
  • 1975

Matijasevič, The Diophantineness of enumerable sets, Dokl

  • V. Ju
  • Akad. Nauk SSSR
  • 1970

On sets of acquaintances and strangers at any party

  • A. W. Goodman
  • Amer. Math. Monthly
  • 1959

Similar Papers

Loading similar papers…