Research Article10.21136/cmj.2026.0355-25englishMay 05, 2026Czechoslovak Mathematical JournalMingyue Chen + 3 more +3CiteListenSave
Research Article10.21136/cmj.2026.0334-25englishApr 24, 2026Czechoslovak Mathematical JournalM Krithika + 1 more +1CiteListenSave
Research Article10.21136/cmj.2026.0160-25englishApr 14, 2026Czechoslovak Mathematical JournalHua WangCiteListenSave
Research Article10.21136/cmj.2026.0215-25englishFeb 23, 2026Czechoslovak Mathematical JournalShamim Sohel + 2 more +2CiteListenSave
Research Article10.21136/cmj.2026.0225-25englishFeb 11, 2026Czechoslovak Mathematical JournalNassima Guennach + 3 more +3CiteListenSave
Research Article10.21136/cmj.2026.0347-25Semi $n$-submodules of modules over commutative ringsJan 26, 2026Czechoslovak Mathematical JournalHani A Khashan + 1 more +1CiteListenSave
Research Article10.21136/cmj.2025.0380-21englishNov 21, 2025Czechoslovak Mathematical JournalLorenzo BonazziLet be $\Gamma(G)$ the Gruenberg-Kegel graph of a finite group $G$. We prove that if $G$ is solvable and $\sigma$ is a cut-set for $\Gamma(G)$, then $G$ has a $\sigma$-series of length $5$ whose factors are controlled. As a consequence, we prove that if $G$ is a solvable group and $\Gamma(G)$ has a cut-vertex $p$, then the Fitting length $\ell_F(G)$ of $G$ is bounded and the bound obtained is the best possible. A cut-set is said \emph{minimal} if it does not contain any other proper subset that is a cut-set for the graph. For a finite solvable group $G$, we give a geometrical description of $\Gamma(G)$ when it has a minimal cut-set of size $2$, for a finite solvable group $G$.Read moreCiteListenSave
Research Article10.21136/cmj.2025.0409-24englishNov 18, 2025Czechoslovak Mathematical JournalLi Fang + 1 more +1CiteListenSave
Research Article10.21136/cmj.2025.0114-25englishNov 10, 2025Czechoslovak Mathematical JournalLiuqing Yang + 2 more +2CiteListenSave
Research Article10.21136/cmj.2025.0060-25englishNov 07, 2025Czechoslovak Mathematical JournalZemin Jin + 3 more +3CiteListenSave