A classification of all possible icosahedral viral capsids is proposed. It takes into account the diversity of hexamers’ compositions, leading to definite capsid size.We showhowthe self-organization of observed capsids during their production results from definite symmetries of constituting hexamers. The division of all icosahedral capsids into four symmetry classes is given. New subclasses implementing the action of symmetry groups Z2, Z3 and S3 are found and described. They concern special cases...

Dürer's engraving Melencolia I famously includes a perspective view of a solid polyhedral block of which the visible portion is an 8-circuit bounding a pentagon-triple+triangle patch. The polyhedron is usually taken to be a cube truncated on antipodal corners, but an infinity of others are compatible with the visible patch. Construction of all cubic polyhedra compatible with the visible portion (i.e., Dürer Polyhedra) is discussed, explicit graphs and symmetries are listed for small cases ( ≤ 18...

We prove that Platonic and some Archimedean polyhedra have the fixed point property in a non-classical sense.

A hyperideal polyhedron is a non-compact polyhedron in the hyperbolic $3$-space ${ℍ}^3$ which, in the projective model for ${ℍ}^3\subset {\mathrm{ℝ\mathbb{P}}}^3$, is just the intersection of ${ℍ}^3$ with a projective polyhedron whose vertices are all outside ${ℍ}^3$ and whose edges all meet ${ℍ}^3$. We classify hyperideal polyhedra, up to isometries of ${ℍ}^3$, in terms of their combinatorial type and of their dihedral angles.

On sait depuis les travaux de Bricard et de Connelly qu’il existe dans l’espace euclidien des polyèdres (non convexes) qui sont flexibles : on peut les déformer continûment sans changer la forme de leurs faces. La conjecture des soufflets affirme que le volume interieur de ces polyèdres est constant au cours de la déformation. Elle a été démontrée récemment par I. Sabitov, qui a pour cela utilisé des outils algébriques inattendus dans ce contexte.

A generalized s-star, s ≥ 1, is a tree with a root Z of degree s; all other vertices have degree ≤ 2. $S_i$ denotes a generalized 3-star, all three maximal paths starting in Z have exactly i+1 vertices (including Z). Let be a surface of Euler characteristic χ() ≤ 0, and m():= ⎣(5 + √49-24χ( ))/2⎦. We prove: (1) Let k ≥ 1, d ≥ m() be integers. Each polyhedral map G on with a k-path (on k vertices) contains a k-path of maximum degree ≤ d in G or a generalized s-star T, s ≤ m(), on d + 2- m() vertices...

Let $P_k$ be a path on $k$ vertices. In an earlier paper we have proved that each polyhedral map $G$ on any compact $2$-manifold $𝕄$ with Euler characteristic $\chi \left(𝕄\right)\le 0$ contains a path $P_k$ such that each vertex of this path has, in $G$, degree $\le k⌊\frac{5+\sqrt{49-24\chi \left(𝕄\right)}}{2}⌋$. Moreover, this bound is attained for $k=1$ or $k\ge 2$, $k$ even. In this paper we prove that for each odd $k\ge \frac{4}{3}⌊\frac{5+\sqrt{49-24\chi \left(𝕄\right)}}{2}⌋+1$, this bound is the best possible on infinitely many compact $2$-manifolds, but on infinitely many other compact $2$-manifolds the upper bound can be lowered to $⌊(k-\frac{1}{3})\frac{5+\sqrt{49-24\chi \left(𝕄\right)}}{2}⌋$.

The weight of a path in a graph is defined to be the sum of degrees of its vertices in entire graph. It is proved that each plane triangulation of minimum degree 5 contains a path P₅ on 5 vertices of weight at most 29, the bound being precise, and each plane triangulation of minimum degree 4 contains a path P₄ on 4 vertices of weight at most 31.

Hyperbolic virtual polytopes arose originally as polytopal versions of counterexamples to the following A.D.Alexandrov’s uniqueness conjecture: Let K ⊂ ℝ3 be a smooth convex body. If for a constant C, at every point of ∂K, we have R 1 ≤ C ≤ R 2 then K is a ball. (R 1 and R 2 stand for the principal curvature radii of ∂K.) This paper gives a new (in comparison with the previous construction by Y.Martinez-Maure and by G.Panina) series of counterexamples to the conjecture. In particular, a hyperbolic...

A subgraph of a plane graph is light if the sum of the degrees of the vertices of the subgraph in the graph is small. It is well known that a plane graph of minimum degree five contains light edges and light triangles. In this paper we show that every plane graph of minimum degree five contains also light stars $K_{1,3}$ and $K_{1,4}$ and a light 4-path P₄. The results obtained for $K_{1,3}$ and P₄ are best possible.