𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A two-family extremal problem in hamming space

✍ Scribed by Rudolf Ahlswede; Abbas El Gamal; King F Pang

Book ID
103059764
Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
176 KB
Volume
49
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Coloring Problem in Hamming Spaces
A Coloring Problem in Hamming Spaces
✍ Patric R.J. Γ–stergΓ₯rd πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 219 KB

The R -domatic number of a graph is the maximum number of colors that can be used to color the vertices of the graph so that all vertices of the graph have at least one vertex of each color within distance R . In this paper the problem of determining the R -domatic number of the n -cube , P ( n , R