OurBigBook About$ Donate
 Sign in Sign up

Triangular prism graph

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Graph theory Extremal graph theory Turán's theorem Rhombus-free edge bound
Created 2026-09-24 Updated 2026-10-14  0 By others on same topic  0 Discussions Create my own version
The triangular prism has six vertices and nine edges. Each edge lies in at most one triangle, so it has no rhombus; its two triangles show that it is not K3,3​=T2​(6).
This is the prism graph built from two triangles.

 Ancestors (8)

  1. Rhombus-free edge bound
  2. Turán's theorem
  3. Extremal graph theory
  4. Graph theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2024 / ii / Paper 2 / 17I / Solution
  • Prism graph

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook