Subsets of Cayley graphs that induce many edges

DOI10.4086/toc.2019.v015a020zbMath1496.05073arXiv1809.10938OpenAlexW3001720442MaRDI QIDQ5215667

Oliver Janzer, Timothy Gowers

Publication date: 12 February 2020

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.10938

zbMATH Keywords

Cayley graphstensorsunique games conjecture

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Multilinear algebra, tensor calculus (15A69)

Related Items (2)

Pseudorandom sets in Grassmann graph have near-perfect expansion ⋮ Polynomial bound for the partition rank vs the analytic rank of tensors

This page was built for publication: Subsets of Cayley graphs that induce many edges