Graph homomorphisms via vector colorings
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...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/143053 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |