Mikhail Kabenyuk

activity

20232026

collaborators

Showing 2024Show all

2 papers · 1 filter

math.CO2024

Minimal pentagulations of $n$ -gons

Mikhail Kabenyuk

A planar graph $G$ is called a pentagulation of an $n$ -gon ( $n \geq$ is an integer) if all faces of $G$ are pentagons, except one, which is an $n$ -gon. A $3$ -connected pentagulation…

math.GR2024

Factorizations of simple groups of order 168 and 360

Mikhail Kabenyuk

A finite group $G$ is called $k$ -factorizable if for any factorization $∣ G ∣ = a_{1} \dots a_{k}$ with $a_{i} > 1$ there exist subsets $A_{i}$ of $G$ with $∣ A_{i} ∣ = a_{i}$ such that $G=A_1\cdots A_k…

Minimal pentagulations of n-gons

Factorizations of simple groups of order 168 and 360

Minimal pentagulations of $n$ -gons