Prefer a chat interface with context about you and your work?
High dimensional Hoffman bound and applications in extremal combinatorics
The n-th tensor power of a graph with vertex set V is the graph on the vertex set V n , where two vertices are connected by an edge if they are connected in each coordinate. One powerful method for upper-bounding the largest independent set in a graph is the …