Combinatorial Mathematics V

Subgroup theorems and graphs....Pages 1-27
Counting unlabeled acyclic digraphs....Pages 28-43
Golay sequences....Pages 44-54
The knotted hexagon....Pages 55-60
On skew room squares....Pages 61-63
Some new constructions for orthogonal designs using circulants....Pages 64-75
A note on asymptotic existence results for orthogonal designs....Pages 76-90
The spectrum of a graph....Pages 91-117
Latin squares composed of four disjoint subsquares....Pages 118-127
The semi-stability of lexicographic products....Pages 128-132
On rings of circuits in planar graphs....Pages 133-140
Sum-free sets in loops....Pages 141-147
Groups with stable graphs....Pages 148-152
A problem in the design of electrical circuits, a generalized subadditive inequality and the recurrence relation j(n,m)=j([n/2],m)+j([n+1/2],m)+j(n,m–1)....Pages 153-169
Orthogonal designs in order 24....Pages 170-174
A schröder triangle: Three combinatorial problems....Pages 175-196
A combinatorial approach to map theory....Pages 197-205
On quasi-multiple designs....Pages 206-208
A generalisation of the binomial coefficients....Pages 209-213