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

An infinite class of generalized room squares

โœ Scribed by J.J. Stiffler; I.F. Blake

Publisher
Elsevier Science
Year
1975
Tongue
English
Weight
599 KB
Volume
12
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

A gcntraiized Room sq~re C of otdelr n and degree k is an (L':) x (",I'} array, each ce!P of which -is either empty or contains an unotdered k-tuple of a set k , ISI = n, such that each row and each alumn of the array rzntains each element of S exactly one ar,d 9 contains each unordered k-tulple of S e,xactly once. Using G class of Steiner systems and a generalized Rolr)rn square c :' order 18 and degree 3 constructed by ad hoc methods, an inifinite class of degree 3 q~cs is construered.

๐Ÿ“œ SIMILAR VOLUMES

An even side analogue of Room squares
An even side analogue of Room squares
โœ D. R. Stinson; W. D. Wallis ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Springer ๐ŸŒ English โš– 569 KB
A generalized room square GRS(4, 24) of
A generalized room square GRS(4, 24) of dimension 9
โœ Earl S. Kramer ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 185 KB

3y using " I nutually disjcW Steiner system S(5.X. 24)s we show the existence of a generalized Room square GRS(4.24) of dimension 9.

An infinite class of reach-preservable g
An infinite class of reach-preservable graphs
โœ Gagliardi, Daniel; Lewinter, Marty ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 42 KB ๐Ÿ‘ 1 views

for all w in G. G is called reach-preservable if each of its spanning trees contains at least one reachpreserving vertex. We show that K 2,n is reach-preservable. We show that a graph is bipartite if and only if given any pair of vertices, there exists a spanning tree in which both vertices a reach-