𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Factorizations of free monoids and unavoidable regularities

✍ Scribed by Stefano Varricchio

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
676 KB
Volume
73
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Symmetry and Factorization of Numerical
Symmetry and Factorization of Numerical Sets and Monoids
✍ Eric Antokoletz; Andy Miller πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 250 KB

A set of integers is said to be symmetric if there is an integer g such that the mapping on β€«ήšβ€¬ given by n Β¬ g y n carries the set bijectively onto its complement in ‫.ήšβ€¬ A numerical monoid A is a submonoid of the additive Γ„ 4 monoid of natural numbers β€«ήŽβ€¬ s 0, 1, 2, . . . whose complement β€«ήŽβ€¬ y A i

A degree condition for the existence of
A degree condition for the existence of regular factors inK1,n-free graphs
✍ Ota, Katsuhiro; Tokuda, Taro πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 260 KB πŸ‘ 2 views

A graph is called K1,.-free if it contains no K l , n as an induced subgraph. Let n ( r 3), r be integers (if r is odd, r 2 n -1). We prove that every Kl,,-free connected graph G with rlV(G)I even has an r-factor if its minimum degree is at least This degree condition is sharp.