Pages that link to "Item:Q2563517"
From MaRDI portal
The following pages link to Orthogonal representations over finite fields and the chromatic number of graphs (Q2563517):
Displaying 22 items.
- Entanglement can increase asymptotic rates of zero-error classical communication over classical channels (Q411372) (← links)
- A new property of the Lovász number and duality relations between graph parameters (Q516767) (← links)
- The hat guessing number of graphs (Q777481) (← links)
- Chromatic number and the 2-rank of a graph (Q1850515) (← links)
- A unified construction of semiring-homomorphic graph invariants (Q2052822) (← links)
- On the subspace choosability in graphs (Q2138578) (← links)
- Interval matrices: realization of ranks by rational matrices (Q2226435) (← links)
- Polynomial time algorithm for min-ranks of graphs with simple tree structures (Q2258079) (← links)
- Topological bounds on the dimension of orthogonal representations of graphs (Q2323086) (← links)
- Matrix completion and tensor rank (Q2805654) (← links)
- Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (Q2848995) (← links)
- On the equivalence between low-rank matrix completion and tensor rank (Q4640079) (← links)
- (Q5009505) (← links)
- (Q5009538) (← links)
- (Q5092401) (← links)
- Topological Bounds for Graph Representations over Any Field (Q5150813) (← links)
- Bounding the Optimal Rate of the ICSI and ICCSI problem (Q5275436) (← links)
- Linear Index Coding via Semidefinite Programming (Q5410256) (← links)
- (Q5743408) (← links)
- (Q5870293) (← links)
- Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank (Q6071819) (← links)
- Local orthogonality dimension (Q6094036) (← links)
