Sierpiński graph
E1090237
UNEXPLORED
The Sierpiński graph is a self-similar, fractal-like graph structure closely related to the Sierpiński triangle and studied in graph theory and fractal geometry.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Sierpiński graph canonical | 1 |
| Sierpiński triangle | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T14265439 — 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: Sierpiński graph Context triple: [Wacław Sierpiński, notableIdea, Sierpiński graph]
-
A.
Sierpiński carpet
The Sierpiński carpet is a classic two-dimensional fractal formed by repeatedly removing central squares from a larger square, resulting in a highly intricate, self-similar pattern with zero area but infinite perimeter.
-
B.
Menger sponge
The Menger sponge is a classic three-dimensional fractal object characterized by infinite surface area and zero volume, constructed by recursively removing cubes from a larger cube.
-
C.
Cayley graph
A Cayley graph is a graphical representation of a group where vertices correspond to group elements and edges represent multiplication by chosen generators, widely used in group theory and geometric group theory.
-
D.
Ulam spiral
The Ulam spiral is a graphical arrangement of the positive integers in a spiral pattern that reveals striking diagonal alignments of prime numbers, suggesting unexpected structure in their distribution.
-
E.
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.
- 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: Sierpiński graph Target entity description: The Sierpiński graph is a self-similar, fractal-like graph structure closely related to the Sierpiński triangle and studied in graph theory and fractal geometry.
-
A.
Sierpiński carpet
The Sierpiński carpet is a classic two-dimensional fractal formed by repeatedly removing central squares from a larger square, resulting in a highly intricate, self-similar pattern with zero area but infinite perimeter.
-
B.
Menger sponge
The Menger sponge is a classic three-dimensional fractal object characterized by infinite surface area and zero volume, constructed by recursively removing cubes from a larger cube.
-
C.
Cayley graph
A Cayley graph is a graphical representation of a group where vertices correspond to group elements and edges represent multiplication by chosen generators, widely used in group theory and geometric group theory.
-
D.
Ulam spiral
The Ulam spiral is a graphical arrangement of the positive integers in a spiral pattern that reveals striking diagonal alignments of prime numbers, suggesting unexpected structure in their distribution.
-
E.
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.
- F. None of above. chosen
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Sierpiński graph