Combinatorial Mathematics VII
Proceedings of the Seventh Australian Conference on Combinatorial Mathematics, Held at the University of Newcastle, Australia, August 20-24, 1979
Published on 1. September 1980
Book
Paperback/Softback
XII, 256 pages
978-3-540-10254-0 (ISBN)
Description
to Ramsey theory.- On automorphisms of doubly resolvable designs.- A computer search for B-coverings.- Some new results on the covering numbers N(t,k,v).- Degree sequences uniquely realisable by hypergraphs.- On generating spatial configurations with identical interpoint distance distributions.- Prime bollean matrices.- Circulant (v,k,?) designs.- Pseudographic realizations of an infinitary degree sequence.- Determining the asymptotic number of phylogenetic trees.- Graphs with regular neighbourhoods.- An approximation algorithm for computing the permanent.- The incidence algebra of a group reduced partially ordered set.- Doubly and orthogonally resolvable quadruple systems.- Establishing the minimality of phylogenetic trees from protein sequences.- A conjecture on two-point deleted subgraphs of cartesian products.- Balanced ternary designs with block size three.- On the compositions of an integer.- Symmetric graphs and a characterization of the odd graphs.- Higher dimensional orthogonal designs and hadamard matrices.- Some designs with block size three.- Some results on Bhaskar Rao designs.- Tales from the "county club".
More details
Series
Edition
1980 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
XII, 256 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 15 mm
Weight
411 gr
ISBN-13
978-3-540-10254-0 (9783540102540)
DOI
10.1007/BFb0088895
Schweitzer Classification
Content
to Ramsey theory.- On automorphisms of doubly resolvable designs.- A computer search for B-coverings.- Some new results on the covering numbers N(t,k,v).- Degree sequences uniquely realisable by hypergraphs.- On generating spatial configurations with identical interpoint distance distributions.- Prime bollean matrices.- Circulant (v,k,?) designs.- Pseudographic realizations of an infinitary degree sequence.- Determining the asymptotic number of phylogenetic trees.- Graphs with regular neighbourhoods.- An approximation algorithm for computing the permanent.- The incidence algebra of a group reduced partially ordered set.- Doubly and orthogonally resolvable quadruple systems.- Establishing the minimality of phylogenetic trees from protein sequences.- A conjecture on two-point deleted subgraphs of cartesian products.- Balanced ternary designs with block size three.- On the compositions of an integer.- Symmetric graphs and a characterization of the odd graphs.- Higher dimensional orthogonal designs and hadamard matrices.- Some designs with block size three.- Some results on Bhaskar Rao designs.- Tales from the "county club".