The Generalised Shift Graph

2017/04/14 by Riis, Milette
#FOS: Mathematics #Logic (math.LO)

paper · doi:10.48550/arxiv.1704.04399

Abstract

In 1968, Erdös defined the Shift Graph as the graph whose vertices are the k-element subsets of [n]=\0,1,2,...,n-1\ such that A=\a₁,...,a_k\ and B=\b₁,...,b_k\ are neighbours iff a₁

Related

• Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane
• Examples of *-commuting maps
• On Graph Induced Symbolic Systems
• Hypercyclic shifts on lattice graphs
• Strong Shift Equivalence in the C*-algebraic setting: Graphs and C*-correspondences