Of planar eulerian graphs and permutations

Gadi Moran

doi:10.1090/S0002-9947-1985-0766222-1

Of planar eulerian graphs and permutations

Research output: Contribution to journal › Article › peer-review

Abstract

Infinite planar Eulerian graphs are used to show that for v > 0 the covering number of the infinite simple group Hv = S/S^v is two. Here S denotes the group of all permutations of a set of cardinality S„, S^v denotes its subgroup consisting of the permutations moving less than elements, and the covering number of a (simple) group G is the smallest positive integer n satisfying Cⁿ = G for every nonunit conjugacy class C in G.

Original language	English
Pages (from-to)	323-341
Number of pages	19
Journal	Transactions of the American Mathematical Society
Volume	287
Issue number	1
DOIs	https://doi.org/10.1090/S0002-9947-1985-0766222-1
State	Published - Jan 1985
Externally published	Yes

ASJC Scopus subject areas

General Mathematics
Applied Mathematics

Access to Document

10.1090/S0002-9947-1985-0766222-1

Cite this

@article{9d71f775a65545ea93a2f462fac42155,

title = "Of planar eulerian graphs and permutations",

abstract = "Infinite planar Eulerian graphs are used to show that for v > 0 the covering number of the infinite simple group Hv = S/Sv is two. Here S denotes the group of all permutations of a set of cardinality S„, Sv denotes its subgroup consisting of the permutations moving less than elements, and the covering number of a (simple) group G is the smallest positive integer n satisfying Cn = G for every nonunit conjugacy class C in G.",

author = "Gadi Moran",

year = "1985",

month = jan,

doi = "10.1090/S0002-9947-1985-0766222-1",

language = "English",

volume = "287",

pages = "323--341",

journal = "Transactions of the American Mathematical Society",

issn = "0002-9947",

publisher = "American Mathematical Society",

number = "1",

}

TY - JOUR

T1 - Of planar eulerian graphs and permutations

AU - Moran, Gadi

PY - 1985/1

Y1 - 1985/1

N2 - Infinite planar Eulerian graphs are used to show that for v > 0 the covering number of the infinite simple group Hv = S/Sv is two. Here S denotes the group of all permutations of a set of cardinality S„, Sv denotes its subgroup consisting of the permutations moving less than elements, and the covering number of a (simple) group G is the smallest positive integer n satisfying Cn = G for every nonunit conjugacy class C in G.

AB - Infinite planar Eulerian graphs are used to show that for v > 0 the covering number of the infinite simple group Hv = S/Sv is two. Here S denotes the group of all permutations of a set of cardinality S„, Sv denotes its subgroup consisting of the permutations moving less than elements, and the covering number of a (simple) group G is the smallest positive integer n satisfying Cn = G for every nonunit conjugacy class C in G.

UR - http://www.scopus.com/inward/record.url?scp=84968468620&partnerID=8YFLogxK

U2 - 10.1090/S0002-9947-1985-0766222-1

DO - 10.1090/S0002-9947-1985-0766222-1

M3 - Article

AN - SCOPUS:84968468620

SN - 0002-9947

VL - 287

SP - 323

EP - 341

JO - Transactions of the American Mathematical Society

JF - Transactions of the American Mathematical Society

IS - 1

ER -

Of planar eulerian graphs and permutations

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this