Weaver’s conjecture
E1522135
UNEXPLORED
Weaver’s conjecture is a problem in functional analysis and operator theory concerning the partitioning of vectors in Hilbert spaces, whose resolution by Marcus, Spielman, and Srivastava led to a proof of the Kadison–Singer problem.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Weaver’s conjecture canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T22150692 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Weaver’s conjecture Context triple: [Bourgain–Tzafriri restricted invertibility principle, relatedTo, Weaver’s conjecture]
-
A.
Pósa’s theorem in graph theory
Pósa’s theorem in graph theory is a result that gives a sufficient degree condition for a finite graph to contain a Hamiltonian cycle.
-
B.
Conway's thrackle conjecture
Conway's thrackle conjecture is an unsolved problem in combinatorial geometry asserting that in any drawing of a graph where every pair of edges meets exactly once, the number of edges cannot exceed the number of vertices.
-
C.
Conway's 99-graph problem
Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
-
D.
König's theorem in graph theory
König's theorem in graph theory is a fundamental result in bipartite graphs stating that the size of a maximum matching equals the size of a minimum vertex cover.
-
E.
Menger theorem in graph theory
Menger's theorem in graph theory is a fundamental result that characterizes the connectivity between two vertices in a graph by equating the maximum number of pairwise internally disjoint paths between them with the minimum size of a vertex cut separating them.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Weaver’s conjecture Target entity description: Weaver’s conjecture is a problem in functional analysis and operator theory concerning the partitioning of vectors in Hilbert spaces, whose resolution by Marcus, Spielman, and Srivastava led to a proof of the Kadison–Singer problem.
-
A.
Pósa’s theorem in graph theory
Pósa’s theorem in graph theory is a result that gives a sufficient degree condition for a finite graph to contain a Hamiltonian cycle.
-
B.
Conway's thrackle conjecture
Conway's thrackle conjecture is an unsolved problem in combinatorial geometry asserting that in any drawing of a graph where every pair of edges meets exactly once, the number of edges cannot exceed the number of vertices.
-
C.
Conway's 99-graph problem
Conway's 99-graph problem is an unsolved combinatorial question in graph theory, posed by John H. Conway, concerning the existence and properties of a hypothetical 99-vertex graph with highly constrained adjacency conditions.
-
D.
König's theorem in graph theory
König's theorem in graph theory is a fundamental result in bipartite graphs stating that the size of a maximum matching equals the size of a minimum vertex cover.
-
E.
Menger theorem in graph theory
Menger's theorem in graph theory is a fundamental result that characterizes the connectivity between two vertices in a graph by equating the maximum number of pairwise internally disjoint paths between them with the minimum size of a vertex cut separating them.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.