Clebsch graph
Clebsch graph is one of two different regular graphs with 16 vertices.
All 4 facts, and where they come from
Facts
4 facts · 0 confirmed by two sources · 0 cited · 4 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2453025957
- Described as
- one of two different regular graphs with 16 vertices
- What it is
- undirected graph; dyad; strongly regular graph
- Named after
- Alfred Clebsch
- Wikipedias with a page
- 7
Wikidata item Q367494 (wikidata.org/wiki/Q367494), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1319834956
In the mathematical field of graph theory, the Clebsch graph is either of two complementary graphs on 16 vertices, a 5-regular graph with 40 edges and a 10-regular graph with 80 edges. The 80-edge graph is the dimension-5 halved cube graph; it was called the Clebsch graph by Seidel (1968) because of its relation to the configuration of 16 lines on the quartic surface discovered in 1868 by the German mathematician Alfred Clebsch. The 40-edge version is the dimension-5 folded cube graph; it is also known as the Greenwood–Gleason graph after the work of Robert E. Greenwood and Andrew M. Gleason (1955), who used it to evaluate the Ramsey number R(3,3,3) = 17.
From the Wikipedia article “Clebsch graph” (en.wikipedia.org/wiki/Clebsch_graph), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
Picture: Wikimedia Commons: Clebsch Lombardi.svg · See Commons file page
