𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the divergence of greedy algorithms with respect to Walsh subsystems in

✍ Scribed by S.A. Episkoposian


Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
133 KB
Volume
66
Category
Article
ISSN
0362-546X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the Number of Edges in Hypergraphs Cr
✍ Alexandr V. Kostochka; Douglas R. Woodall πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 94 KB

A colouring of the vertices of a hypergraph G is called strong if, for every edge A, the colours of all vertices in A are distinct. It corresponds to a colouring of the generated graph (G) obtained from G by replacing every edge by a clique. We estimate the minimum number of edges possible in a k-cr