✦ LIBER ✦

Some Results on Radical Extensions

✍ Scribed by F.B. Mora; W.Y. Velez

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 265 KB
Volume: 162
Category: Article
ISSN: 0021-8693
DOI: 10.1006/jabr.1993.1254

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some Results on Carathéodory Selections

Some Results on Carathéodory Selections and Extensions

✍ Anna Kucia 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 240 KB

Extensions of some factorization results

Extensions of some factorization results from simple graphs to multigraphs

✍ El-Zanati, S. I.; Plantholt, M. J.; Tipnis, S. K. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 71 KB

It was shown in a recent paper that an rs-regular multigraph G with maximum multiplicity µ(G) ≤ r can be factored into r regular simple graphs if first we allow the deletion of a relatively small number of hamilton cycles from G. In this paper, we use this theorem to obtain extensions of some factor

Some results on generalized exponents

✍ Neufeld, Stewart; Shen, Jian 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 241 KB

A digraph G = (V, E) is primitive if, for some positive integer k, there is a u → v walk of length k for every pair u, v of vertices of V . The minimum such k is called the exponent of G, denoted exp(G). The exponent of a vertex u ∈ V , denoted exp(u), is the least integer k such that there is a u →

Some results on linear arboricity

✍ Filip Guldan 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

Some results on the achromatic number

✍ Cairnie, Niall; Edwards, Keith 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

Let G be a simple graph. The achromatic number ψ(G) is the largest number of colors possible in a proper vertex coloring of G in which each pair of colors is adjacent somewhere in G. For any positive integer m, let q(m) be the largest integer k such that ( k 2 ) ≤ m. We show that the problem of dete

Some new results on superimposed codes

✍ Hyun Kwang Kim; Vladimir Lebedev; Dong Yeol Oh 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB

## Abstract A (__w__,__r__) __cover‐free family__ is a family of subsets of a finite set such that no intersection of __w__ members of the family is covered by a union of __r__ others. A (__w__,__r__) __superimposed code__ is the incidence matrix of such a family. Such a family also arises in crypt