Combinatorial Mathematics IV
Proceedings of the Fourth Australian Conference, Held at the University of Adelaide, 27-29 August, 1975
Published on 1. December 1976
Book
Paperback/Softback
VI, 249 pages
978-3-540-08053-4 (ISBN)
Description
Comma-free codes and incidence algebras.- Non-orthogonal graeco-latin designs.- An infinite family of skew weighing matrices.- Some elementary aspects of the catalan numbers.- Some new constructions for orthogonal designs.- Bounds of finite relations.- Products of graphs and their spectra.- Some computational results on the spectra of graphs.- A non-imbeddable proper colouring.- Minimal degree of primitive permutation groups.- Number of factors in K-cycle decompositions of permutations.- Some incidence structures of maximal rank.- A theorem on planar graphs.- The number and stability indices of Cn-trees.- On crystallographic colour groups.- Designs from cyclotomy.- Bordered symmetric square roots of the identity matrix.- Integer sequences with given sum and restricted differences.- Orthogonal designs in order sixteen.- Counting arrangements of bishops.- The principle of random union of gametes in a finite population.- The stability index of the product of a path and a tree.- Computation of g(1,3;12).- Embedding proper colourings.- Some large subsquares.
More details
Series
Edition
1976 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
VI, 249 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 15 mm
Weight
406 gr
ISBN-13
978-3-540-08053-4 (9783540080534)
DOI
10.1007/BFb0097362
Schweitzer Classification
Content
Comma-free codes and incidence algebras.- Non-orthogonal graeco-latin designs.- An infinite family of skew weighing matrices.- Some elementary aspects of the catalan numbers.- Some new constructions for orthogonal designs.- Bounds of finite relations.- Products of graphs and their spectra.- Some computational results on the spectra of graphs.- A non-imbeddable proper colouring.- Minimal degree of primitive permutation groups.- Number of factors in K-cycle decompositions of permutations.- Some incidence structures of maximal rank.- A theorem on planar graphs.- The number and stability indices of Cn-trees.- On crystallographic colour groups.- Designs from cyclotomy.- Bordered symmetric square roots of the identity matrix.- Integer sequences with given sum and restricted differences.- Orthogonal designs in order sixteen.- Counting arrangements of bishops.- The principle of random union of gametes in a finite population.- The stability index of the product of a path and a tree.- Computation of g(1,3;12).- Embedding proper colourings.- Some large subsquares.