{"version":"1.0","type":"link","title":"Shift graph - Newikis","description":"In graph theory, the shift graph Gn,k for is the graph whose vertices correspond to the ordered -tuples with and where two vertices are adjacent if and only if or for all . Shift graphs are triangle-free, and for fixed their chromatic number tend to infinity with . It is natural to enhance the…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}