Graph homomorphisms via vector colorings

• المؤلفون الرئيسيون: Godsil, Chris, Roberson, David E., Rooney, Brendan, Šámal, Robert, Varvitsiotis, Antonios
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: مقال
• اللغة: English
• منشور في: 2020
• الموضوعات: Science::Mathematics
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/143053

In this paper we study the existence of homomorphisms G→H using semidefinite programming. Specifically, we use the vector chromatic number of a graph, defined as the smallest real number t≥2 for which there exists an assignment of unit vectors i↦p i to its vertices such that 〈p i ,p j 〉≤−1∕(t−1), wh...