✦ LIBER ✦

A Note on Alperin′s Conjecture

✍ Scribed by G.R. Robinson

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 147 KB
Volume: 165
Category: Article
ISSN: 0021-8693
DOI: 10.1006/jabr.1994.1133

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Notes on Ruscheweyh's Multiplier Conject

Notes on Ruscheweyh's Multiplier Conjecture

✍ Jian-Lin Li 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 56 KB

In this note we show that Ruscheweyh's multiplier conjecture is true in several special cases. The results obtained here are closely related to the partial sums of certain analytic functions defined by means of univalent functions. We also answer a question of Ponnusamy concerning the nth partial su

A note on the abc conjecture

✍ Pei-Chu Hu; Chung-Chun Yang 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 187 KB

A note on possible extensions of Negami'

A note on possible extensions of Negami's conjecture

✍ Hlin?n�, Petr 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 239 KB 👁 2 views

A graph H is a cover of a graph G, if there exists a mapping ϕ from V (H) onto V (G) such that for every vertex v of G, ϕ maps the neighbors of v in H bijectively onto the neighbors of ϕ(v) in G. Negami conjectured in 1987 that a connected graph has a finite planar cover if and only if it embeds in

A Local Strategy to Decide the Alperin a

A Local Strategy to Decide the Alperin and Dade Conjectures

✍ Jianbei An; E.A. O'Brien 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 255 KB

We present a new strategy which exploits both the maximal and p-local subgroup structure of a given finite simple group in order to decide the Alperin and Dade conjectures for this group. We demonstrate the computational effectiveness of this approach by using it to verify these conjectures for the

A Note on a Conjecture of Erdős

A Note on a Conjecture of Erdős and Rosenfeld

✍ Jorge Jiménez-Urroz 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 78 KB

We prove a special case of a conjecture of Erdo s and Rosenfeld regarding factor difference sets of integers.

Note on a min-max conjecture of Woodall

✍ Orlando Lee; Yoshiko Wakabayashi 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 78 KB

## Abstract In 1978 Woodall [6] conjectured the following: in a planar digraph the size of a shortest cycle is equal to the maximum cardinality of a collection of disjoint tranversals of cycles. We prove that this conjecture is true when the digraph is series‐parallel. In fact, we prove a stronger