Blanuša snarks
E1182411
UNEXPLORED
Blanuša snarks are early, highly symmetric examples of cubic, bridgeless graphs with edge-chromatic number four that played a key role in the study of snarks and graph coloring theory.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Blanuša snarks canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T15918583 — 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: Blanuša snarks Context triple: [Szekeres snark, isComparedWith, Blanuša snarks]
-
A.
Szekeres snark
The Szekeres snark is a famous cubic graph in graph theory that serves as a counterexample in edge-coloring problems and helped advance the study of snark graphs.
-
B.
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.
-
C.
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.
-
D.
Graham–Pollak theorem
The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
-
E.
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.
- 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: Blanuša snarks Target entity description: Blanuša snarks are early, highly symmetric examples of cubic, bridgeless graphs with edge-chromatic number four that played a key role in the study of snarks and graph coloring theory.
-
A.
Szekeres snark
The Szekeres snark is a famous cubic graph in graph theory that serves as a counterexample in edge-coloring problems and helped advance the study of snark graphs.
-
B.
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.
-
C.
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.
-
D.
Graham–Pollak theorem
The Graham–Pollak theorem is a result in graph theory that states the edges of a complete graph on n vertices cannot be partitioned into fewer than n−1 complete bipartite subgraphs.
-
E.
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.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.