2 papers
math.CO2026
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert +2
We prove RE-completeness of the quantum homomorphism problem parameterised by families of graphs derived from the classic metric association schemes. These include Kneser graphs, $…
math.CO2025
Word-Representable Graphs and Locality of Words
Philipp Böll, Pamela Fleischmann, Annika Huch +4
In this work, we investigate the relationship between -repre\-sentable graphs and graphs representable by -local words. In particular, we show that every graph representable…