𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Countably determined sets and a conjecture of C.W. Henson

✍ Scribed by Hermann Render

Publisher
Springer
Year
1995
Tongue
English
Weight
883 KB
Volume
303
Category
Article
ISSN
0025-5831

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A graph-theoretic version of the union-c
A graph-theoretic version of the union-closed sets conjecture
✍ El-Zahar, Mohamed H. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 128 KB πŸ‘ 2 views

An induced subgraph S of a graph G is called a derived subgraph of G if S contains no isolated vertices. An edge e of G is said to be residual if e occurs in more than half of the derived subgraphs of G. We introduce the conjecture: Every non-empty graph contains a non-residual edge. This conjecture

A counter-example to a conjecture relati
A counter-example to a conjecture relating complete sets of frequency squares and affine geometries
✍ C. Laywine πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 459 KB

By generalizing the construction of complete sets of mutually orthogonal latin squares from affine planes, showed how to obtain complete sets of mutually orthogonal frequency squares from affine geometries. In this paper, the construction of a complete set of frequency squares not equivalent to an