Balinski's theorem

Balinski's theorem

Graphs of d-dimensional polytopes are d-connected.

Common
3 views/day0 owners

No account needed. By playing, you confirm you're 13 or older and agree to the Terms of use.

No owners yet

CommonThe rest

Category: Empty

0 owners
0 copies
0 pulls
Wishlisted
0
In 0 albums
On 0 showcases
Market listings
0
Wikipedia views per dayLast 30 days 103

Not sold on the market yet.

Readers' pathsAug 2026 – Oct 2026

Readers go next to

Share of the 13 clicks on its links

No card

Readers come from

Share of the 12 readers arriving from another article

  1. Polyhedral graph

    Graph made from vertices and edges of a convex polyhedron.

    100%