Noncontextual coloring of orthogonality hypergraphs
From MaRDI portal
(Redirected from Publication:5883898)
Recommendations
Cites work
- A Finite Orthomodular Lattice Which Does Not Admit a Full Set of States
- A Short Proof of the Factor Theorem for Finite Graphs
- A variant of the Kochen-Specker theorem localising value indefiniteness
- Algorithms for Greechie diagrams
- Bell-Kochen-Specker theorem: a proof with 18 vectors.
- Colouring the rational quantum sphere and the Kochen-Specker theorem
- Diagrams of Kochen-Specker type constructions
- Finite Precision Measurement Nullifies the Kochen-Specker Theorem
- Generalized Greenberger-Horne-Zeilinger arguments from quantum logical analysis
- Good characterizations for some degree constrained subgraphs
- Greechie diagrams, nonexistence of measures in quantum logics, and Kochen–Specker-type constructions
- scientific article; zbMATH DE number 3174491 (Why is no real title available?)
- scientific article; zbMATH DE number 45942 (Why is no real title available?)
- scientific article; zbMATH DE number 3561308 (Why is no real title available?)
- scientific article; zbMATH DE number 3807678 (Why is no real title available?)
- scientific article; zbMATH DE number 3251317 (Why is no real title available?)
- scientific article; zbMATH DE number 3273135 (Why is no real title available?)
- Hypergraph theory. An introduction
- Kochen–Specker vectors
- On the Shannon capacity of a graph
- On the structure of orthomodular lattices satisfying the chain condition
- Orthogonal representations and connectivity of graphs
- Orthomodular lattices admitting no states
- Some results from the combinatorial approach to quantum logic
- The logic of quantum mechanics
- Three short proofs in graph theory
- You can't paint yourself into a corner
Cited in
(3)
This page was built for publication: Noncontextual coloring of orthogonality hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883898)