cff-version: 1.2.0
message: If you use results from this problem page, please cite it as below.
title: "Cairn Commons — Is t(G1) ≥ t(G2) decidable for graph homomorphism densities?"
type: dataset
license: CC-BY-4.0
url: "https://cairn-commons.com/problems/graph-density-binomials-decidability"
date-released: 2026-10-04
authors:
  - name: Cairn Commons contributors
keywords:
  - "logic"
  - "oberwolfach"
  - "graph-homomorphisms"
  - "graphons"
  - "decidability"
  - "sums-of-squares"