๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A proof of Szep's conjecture on nonsimplicity of certain finite groups

โœ Scribed by Elsa Fisman; Zvi Arad


Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
794 KB
Volume
108
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Proof of a Conjecture of Bollob?s on Nes
โœ Guantao Chen; Paul Erdรณs; William Staton ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 221 KB

For any positive integer k, a minimum degree condition is obtained which forces a graph to have k edge-disjoint cycles C 1 , C 2 , ..., C k such that V(C 1

On Hadamard Property of a Certain Class
โœ Jung R. Cho; Noboru Ito; Pan Soo Kim ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 124 KB

Utilizing results of Nekrasov and Berkovich we investigate Hadamard property of a certain class of finite groups แฎŠ 1998 Academic Press 666

Proof of a conjecture on game domination
โœ O. Favaron; H. Karami; R. Khoeilar; S. M. Sheikholeslami; L. Volkmann ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 87 KB ๐Ÿ‘ 1 views

## Abstract The game domination number of a (simple, undirected) graph is defined by the following game. Two players, \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}${\mathcal{A}}$\end{document} and \docume

Proof of a conjecture on Genocchi number
โœ John Riordan; Paul R. Stein ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 446 KB

In [ I ]I, Gandhi has stated the following conjecture on Genocchi numbl:rs: ## . z;(t~-I)~ . The meaning of the odd notation on the 1e:ft of (1) is as follows: write . . . C(k+n-1)2 ; then ## K(n+l,k)=k2K(n,k+lj-(k-l)2~(~~,k~ K(1,k)=k2-(k-1;j2 =2k--1 alId, af course, (1) is restated as (1')