𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalization of Thue′s Theorem and Computation of the Group K2OF

✍ Scribed by M. Skalba

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
457 KB
Volume
46
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

✦ Synopsis

The paper presents the generalization of Thue's theorem and its applications in computing the group (K_{2} \mathrm{O}{F})-a new proof of the finite generation of (K{2} \mathrm{O}{F}) is given and the main result is (K{2} O_{r}=1) for (F=Q(\sqrt{-19})). Analogously one can prove that (K_{2} \mathbf{O}_{F}=1) for (F=Q(\sqrt{-5}) . \quad 01994) Academic Press. Inc.

📜 SIMILAR VOLUMES

Generalizations of the k-factor theorem
Generalizations of the k-factor theorem
✍ Sukhamay Kundu 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 614 KB

In this paper, we give a more general sufficient condition for a degree sequence (di) to be realizable by a graph (without multiple edges and loops) containing a subgraph of specified degree sequence tki)\* When sequences (di) and (dim ki) are both realizable by graphs, it was shown earlier that the

Neighborhood unions and a generalization
Neighborhood unions and a generalization of Dirac's theorem
✍ R.J. Faudree; R.J. Gould; M.S. Jacobson; L.M. Lesniak 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 818 KB

Dirac proved that if each vertex of a graph G of order n 23 has degree at least n/2, then the graph is Hamiltonian. This result will be generalized by showing that if the union of the neighborhoods of each pair of vertices of a 2connected graph G of sufficiently large order n has at least n/2 vertic