Everything about Clebsch graph
One of two different regular graphs with 16 vertices
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, who used it to evaluate the Ramsey number R(3,3,3) = 17. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Clebsch graphA 5-minute orientation
- Read the landmark paper: On splitting the Clebsch graphCited 3 times
- Go sideways: Grötzsch graphA closely related topic
- Go sideways: Halved cube graphA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
Open Library didn't respond; try again in a moment.
đź”— Related topics
- Grötzsch graph In the mathematical field of graph theory, the Grötzsch graph is a triangle-free graph with 11 vertices, 20 edges, chromatic number 4, and crossing number…
- Halved cube graph In graph theory, the halved cube graph or half cube graph of dimension n is the vertex-edge graph of the demihypercube, formed by connecting pairs of vertices…
- Glossary of graph theory Look up Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs,…
- Desargues graph In the mathematical field of graph theory, the Desargues graph is a distance-transitive, cubic graph with 20 vertices and 30 edges. It is named after Girard…
- Gosset graph The Gosset graph, named after Thorold Gosset, is a distance-regular graph with 56 vertices and valency 27. It is the 1-skeleton of the 7-dimensional 321…
- Hoffman graph In the mathematical field of graph theory, the Hoffman graph is a 4-regular graph with 16 vertices and 32 edges discovered by Alan Hoffman. Published in…
- Folded cube graph In graph theory, a folded cube graph is an undirected graph formed from a hypercube graph by adding to it a perfect matching that connects opposite pairs…
- Diamond graph In the mathematical field of graph theory, the diamond graph is a planar, undirected graph with 4 vertices and 5 edges. It consists of a complete graph…