Topological bounds on the dimension of orthogonal representations of graphs

DOI10.1016/j.ejc.2019.04.006zbMath1420.05122arXiv1811.11488OpenAlexW2963484777WikidataQ127893814 ScholiaQ127893814MaRDI QIDQ2323086

Ishay Haviv

Publication date: 30 August 2019

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Borsuk-Ulam theoremKneser conjecture

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Strongly self-dual polytopes and distance graphs in the unit sphere, Local orthogonality dimension, Unnamed Item, Topological Bounds for Graph Representations over Any Field, Unnamed Item, Spectral lower bounds for the orthogonal and projective ranks of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalized Kneser conjecture
• Kneser's conjecture, chromatic number, and homotopy
• On the quantum chromatic number of a graph
• A short proof of Kneser's conjecture
• The Shannon capacity of a union
• Generalized Kneser coloring theorems with combinatorial proofs
• New lower bound on the Shannon capacity of \(C_7\) from circular graphs
• Topological lower bounds for the chromatic number: a hierarchy
• Orthogonal representations and connectivity of graphs
• A combinatorical proof of Kneser's conjecture
• Orthogonal representations over finite fields and the chromatic number of graphs
• Index Coding—An Interference Alignment Perspective
• H-wise independence
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Equivariant Cohomology and Lower Bounds for Chromatic Numbers
• The zero-error side information problem and chromatic numbers (Corresp.)
• On the Shannon capacity of a graph
• Boolean Circuits, Tensor Ranks, and Communication Complexity
• A New Short Proof of Kneser's Conjecture
• A Bound on the Shannon Capacity via a Linear Programming Variation
• Kochen–Specker Sets and the Rank-1 Quantum Chromatic Number
• Index Coding With Side Information
• On the Hardness of Approximating the Network Coding Capacity
• Linear Index Coding via Semidefinite Programming