On non-optimally expanding sets in Grassmann graphs

DOI10.1007/S11856-021-2164-7OpenAlexW3170971055MaRDI QIDQ2048867FDOQ2048867

Shmuel Safra, Irit Dinur, Subhash Khot, Dor Minzer, Guy Kindler

Publication date: 24 August 2021

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11856-021-2164-7

Mathematics Subject Classification ID

Theory of computing (68Qxx) Graph theory (05Cxx) Algebraic combinatorics (05Exx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some optimal inapproximability results
• Erdős–Ko–Rado Theorems: Algebraic Approaches
• On the power of unique 2-prover 1-round games
• On Certain Sets of Integers
• A PCP characterization of NP with optimal amortized query complexity
• Simple analysis of graph tests for linearity and PCP
• Friedgut--Kalai--Naor theorem for slices of the Boolean cube
• An orthogonal basis for functions over a slice of the Boolean hypercube
• Invariance principle on the slice
• The Erdős-Ko-Rado theorem for vector spaces
• The Goldman-Rota identity and the Grassmann scheme
• A positive combinatorial formula for the complexity of the \(q\)-analog of the \(n\)-cube
• On independent sets, 2-to-2 games, and Grassmann graphs
• Harmonicity and invariance on slices of the Boolean cube
• Towards a proof of the 2-to-1 games conjecture?
• On non-optimally expanding sets in Grassmann graphs
• A new point of NP-hardness for unique games

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: On non-optimally expanding sets in Grassmann graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2048867)