Undecidability of polynomial inequalities in weighted graph homomorphism densities

DOI10.1017/fms.2024.19arXiv2207.12378MaRDI QIDQ6131051

No author found.

Publication date: 4 April 2024

Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.12378

zbMATH Keywords

polynomial inequalitieshomomorphism densities of graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Decidability and field theory (12L05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
• Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Explicit Ramsey graphs and orthonormal labelings
• On the local approach to Sidorenko's conjecture
• Non-bipartite \(k\)-common graphs
• A correlation inequality for bipartite graphs
• Random graphons and a weak Positivstellensatz for graphs
• Reflection positivity, rank connectivity, and homomorphism of graphs
• On the Minimal Density of Triangles in Graphs
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• Undecidability of linear inequalities in graph homomorphism densities
• Flag algebras

This page was built for publication: Undecidability of polynomial inequalities in weighted graph homomorphism densities