✦ LIBER ✦

On large sets of Pk-decompositions

✍ Scribed by Yanfang Zhang

Publisher: John Wiley and Sons
Year: 2005
Tongue: English
Weight: 81 KB
Volume: 13
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.20056

No coin nor oath required. For personal study only.

✦ Synopsis

Let G ¼ ðVðGÞ; EðGÞÞ be a graph. A ðv v v; G; Þ-GD is a partition of all the edges of

LGD. In this paper, we obtain a general result by using the finite fields, that is, if q ! k ! 2 is an odd prime power, then there exists a ðq; P k ; k À 1Þ-LGD.

📜 SIMILAR VOLUMES

On large sets of almost Hamilton cycle d

On large sets of almost Hamilton cycle decompositions

✍ Hongtao Zhao; Qingde Kang 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB 👁 1 views

## Abstract A large set of __CS__(__v__, __k__, λ), __k__‐cycle system of order __v__ with index λ, is a partition of all __k__‐cycles of __K__~__v__~ into __CS__(__v__, __k__, λ)s, denoted by __LCS__(__v__, __k__, λ). A (__v__ − 1)‐cycle is called almost Hamilton. The completion of the existence s

Large set of P3-decompositions

✍ Qingde Kang; Yanfang Zhang 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 113 KB

## Abstract Let __G__=(__V__(__G__),__E__(__G__)) be a graph. A (__n__,__G__, λ)‐__GD__ is a partition of the edges of λ__K__~__n__~ into subgraphs (__G__‐blocks), each of which is isomorphic to __G__. The (__n__,__G__,λ)‐__GD__ is named as graph design for __G__ or __G__‐decomposition. The large s

Decompositions of Difference Sets

✍ Dieter Jungnickel; Vladimir D Tonchev 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 122 KB

We characterize those symmetric designs with a Singer group G which admit a quasi-regular G-invariant partition into strongly induced symmetric subdesigns. In terms of the corresponding difference sets, the set associated with the larger design can be decomposed into a difference set describing the

Note on large sets of infinite steiner s

Note on large sets of infinite steiner systems

✍ Peter J. Cameron 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 250 KB 👁 1 views

Large sets of Steiner systems s ( t , k , n ) exist for all finite t and k with t < k and all infinite n. The vector space analogues exist over a field F for all finite t and k with f < R provided that either v or F is infinite, and n 1 2k -t + 1. This inequality is best possible. o 1995 John Wiley

Uniform rational approximation on large

Uniform rational approximation on large data sets

✍ E. H. Kaufman Jr.; S. F. McCormick; G. D. Taylor 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 476 KB

Decompositions of Modules Associated to

Decompositions of Modules Associated to Finite Partially Ordered Sets

✍ Johannes Siemons 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 139 KB