Undecidability of linear inequalities in graph homomorphism densities (Q5390541): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3912837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflection positivity, rank connectivity, and homomorphism of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Acquaintances and Strangers at any Party / rank
 
Normal rank
Property / cites work
 
Property / cites work: The homomorphism domination exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3160258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of dense graph sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flag algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimal Density of Triangles in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5792485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The coloring of graphs / rank
 
Normal rank

Latest revision as of 22:09, 3 July 2024

scientific article; zbMATH DE number 5873835
Language Label Description Also known as
English
Undecidability of linear inequalities in graph homomorphism densities
scientific article; zbMATH DE number 5873835

    Statements

    Undecidability of linear inequalities in graph homomorphism densities (English)
    0 references
    0 references
    0 references
    4 April 2011
    0 references
    graph homomorphism density
    0 references
    quantum graph
    0 references
    decidability
    0 references
    Artin's theorem
    0 references

    Identifiers