Designs and Graphs
Published on 6. June 2016
435 pages
978-1-4832-9475-9 (ISBN)
Description
In 1988, the news of Egmont Köhler's untimely death at the age of 55reached his friends and colleagues. It was widely felt that a lastingmemorial tribute should be organized. The result is the present volume,containing forty-two articles, mostly in combinatorial design theory andgraph theory, and all in memory of Egmont Köhler. Designs and graphswere his areas of particular interest; he will long be remembered for hisresearch on cyclic designs, Skolem sequences, t-designs and theOberwolfach problem. Professors Lenz and Ringel give a detailedappreciation of Köhler's research in the first article of thisvolume.There is, however, one aspect of Egmont Köhler's biographythat merits special attention. Before taking up the study of mathematics atthe age of 31, he had completed training as a musician (studying bothcomposition and violoncello at the Musikhochschule in Berlin), and workedas a cellist in a symphony orchestra for some years. This accounts for hisinterest in the combinatorial aspects of music. His work and lectures inthis direction had begun to attract the interest of many musicians, and hehad commenced work on a book on mathematical aspects of musical theory. Itis tragic indeed that his early death prevented the completion of his work;the surviving paper on the classification and complexity of chordsindicates the loss that his death meant to the area, as he was almostuniquely qualified to bring mathematics and music together, being aprofessional in both fields.
More details
Other editions
Additional editions
C.J. Colbourn | D. Jungnickel | A. Rosa
Designs and Graphs: Volume 4
Book
03/1992
North-Holland
€54.46
Article exhausted; check different version
Content
A Brief Review on Egmont Köhler's Mathematical Work. Edge-pancyclicBlock-intersection Graphs. Symmetric Divisible Designs with k -λ1 = 1. Some Constructions of Group Divisible Designs withSinger Groups. On Indecomposable Pure Mendelsohn Triple Systems. ACombinatorial Characterization of Geometric Spreads. Hermitian Unitals areCode Words. Long Cycles in Subgraphs with Prescribed Minimum Degree. Coversof Graphs and EGQs. The 2-rotational Steiner Triple Systems of Order 25.Outline Symmetric Latin Squares. Intersections and Supports of QuadrupleSystems. Directed Star Decompositions of Directed Multigraphs. Some NaiveConstructions of S(2,3,v) and S(2,4,v).On the Maximum Cardinality of Binary Constant Weight Codes with PrescribedDistance. Über einen Satz von Köhler. Mutually Balanced NestedDesigns. Difference Families from Rings. Transitive MultipermutationGraphs. On Infinite Steiner Systems. Tree-partitions of Infinite Graphs.Plane Four-regular Graphs with Vertex-to-vertex Unit Triangles. SimpleDirect Constructions for Hybrid Triple Designs. Sets in a Finite Plane withFew Intersection Numbers and a Distinguished Point. The Existence ofCk-factorizations of K2n -F. Self-orthogonal Hamilton Path Decompositions. Cyclic 2-(91,6,1)Designs with Multiplier Automorphisms. The Spectrum of α-resolvableBlock Designs With Block Size 3. On Near Generalized Balanced TournamentDesigns. On Parallelism in Steiner Systems. Skolem Labelled Graphs. On theSimplicity of ˙2 and ˙3. A Class of 2-Chromatic SQS(22). TheSolution of the Bipartite Analogue of the Oberwolfach Problem. The Spectrumof Maximal Sets of One-factors. A Note on Check Character Systems UsingLatin Squares. On the Existence of Cyclic Steiner Quadruple SystemsSQS(2p). Designs Constructed from Maximal Arcs. On the ChromaticNumber of Special Distance Graphs. About Special Classes of Steiner SystemsS(2,4,v). A Few More RBIBDs with k=5 andλ=1. Research Problems.
