The (generalized) orthogonality dimension of (generalized) kneser graphs: bounds and applications

DOI10.4230/lipics.ccc.2021.8OpenAlexW3183226436MaRDI QIDQ6115359

Alexander Golovnev, Ishay Haviv

Publication date: 12 July 2023

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2021/14282/pdf/LIPIcs-CCC-2021-8.pdf/

zbMATH Keywords

rigiditychromatic numbercircuit complexityhardness of approximationKneser graphsminrankorthogonality dimension

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

On the subspace choosability in graphs ⋮ Unnamed Item

This page was built for publication: The (generalized) orthogonality dimension of (generalized) kneser graphs: bounds and applications