๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minimizing the number of transitions with respect to observation equivalence

โœ Scribed by Jaana Eloranta


Publisher
Springer Netherlands
Year
1991
Tongue
English
Weight
923 KB
Volume
31
Category
Article
ISSN
0006-3835

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