Designs and Graphs
- 1st Edition, Volume 4 - March 25, 1992
- Imprint: North Holland
- Editors: C.J. Colbourn, D. Jungnickel, A. Rosa
- Language: English
- eBook ISBN:9 7 8 - 1 - 4 8 3 2 - 9 4 7 5 - 9
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… Read more
Purchase options
Institutional subscription on ScienceDirect
Request a sales quoteIn 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.
A Brief Review on Egmont Köhler's Mathematical Work. Edge-pancyclic
Block-intersection Graphs. Symmetric Divisible Designs with k -
&lgr;1 = 1. Some Constructions of Group Divisible Designs with
Singer Groups. On Indecomposable Pure Mendelsohn Triple Systems. A
Combinatorial Characterization of Geometric Spreads. Hermitian Unitals are
Code Words. Long Cycles in Subgraphs with Prescribed Minimum Degree. Covers
of Graphs and EGQs. The 2-rotational Steiner Triple Systems of Order 25.
Outline Symmetric Latin Squares. Intersections and Supports of Quadruple
Systems. Directed Star Decompositions of Directed Multigraphs. Some Naive
Constructions of S(2,3,v) and S(2,4,v).
On the Maximum Cardinality of Binary Constant Weight Codes with Prescribed
Distance. Über einen Satz von Köhler. Mutually Balanced Nested
Designs. Difference Families from Rings. Transitive Multipermutation
Graphs. On Infinite Steiner Systems. Tree-partitions of Infinite Graphs.
Plane Four-regular Graphs with Vertex-to-vertex Unit Triangles. Simple
Direct Constructions for Hybrid Triple Designs. Sets in a Finite Plane with
Few Intersection Numbers and a Distinguished Point. The Existence of
Ck-factorizations of K2n -
F. Self-orthogonal Hamilton Path Decompositions. Cyclic 2-(91,6,1)
Designs with Multiplier Automorphisms. The Spectrum of &agr;-resolvable
Block Designs With Block Size 3. On Near Generalized Balanced Tournament
Designs. On Parallelism in Steiner Systems. Skolem Labelled Graphs. On the
Simplicity of ˙2 and ˙3. A Class of 2-Chromatic SQS(22). The
Solution of the Bipartite Analogue of the Oberwolfach Problem. The Spectrum
of Maximal Sets of One-factors. A Note on Check Character Systems Using
Latin Squares. On the Existence of Cyclic Steiner Quadruple Systems
SQS(2p). Designs Constructed from Maximal Arcs. On the Chromatic
Number of Special Distance Graphs. About Special Classes of Steiner Systems
S(2,4,v). A Few More RBIBDs with k=5 and
&lgr;=1. Research Problems.
Block-intersection Graphs. Symmetric Divisible Designs with k -
&lgr;1 = 1. Some Constructions of Group Divisible Designs with
Singer Groups. On Indecomposable Pure Mendelsohn Triple Systems. A
Combinatorial Characterization of Geometric Spreads. Hermitian Unitals are
Code Words. Long Cycles in Subgraphs with Prescribed Minimum Degree. Covers
of Graphs and EGQs. The 2-rotational Steiner Triple Systems of Order 25.
Outline Symmetric Latin Squares. Intersections and Supports of Quadruple
Systems. Directed Star Decompositions of Directed Multigraphs. Some Naive
Constructions of S(2,3,v) and S(2,4,v).
On the Maximum Cardinality of Binary Constant Weight Codes with Prescribed
Distance. Über einen Satz von Köhler. Mutually Balanced Nested
Designs. Difference Families from Rings. Transitive Multipermutation
Graphs. On Infinite Steiner Systems. Tree-partitions of Infinite Graphs.
Plane Four-regular Graphs with Vertex-to-vertex Unit Triangles. Simple
Direct Constructions for Hybrid Triple Designs. Sets in a Finite Plane with
Few Intersection Numbers and a Distinguished Point. The Existence of
Ck-factorizations of K2n -
F. Self-orthogonal Hamilton Path Decompositions. Cyclic 2-(91,6,1)
Designs with Multiplier Automorphisms. The Spectrum of &agr;-resolvable
Block Designs With Block Size 3. On Near Generalized Balanced Tournament
Designs. On Parallelism in Steiner Systems. Skolem Labelled Graphs. On the
Simplicity of ˙2 and ˙3. A Class of 2-Chromatic SQS(22). The
Solution of the Bipartite Analogue of the Oberwolfach Problem. The Spectrum
of Maximal Sets of One-factors. A Note on Check Character Systems Using
Latin Squares. On the Existence of Cyclic Steiner Quadruple Systems
SQS(2p). Designs Constructed from Maximal Arcs. On the Chromatic
Number of Special Distance Graphs. About Special Classes of Steiner Systems
S(2,4,v). A Few More RBIBDs with k=5 and
&lgr;=1. Research Problems.
- Edition: 1
- Volume: 4
- Published: March 25, 1992
- No. of pages (eBook): 0
- Imprint: North Holland
- Language: English
- eBook ISBN: 9781483294759
CC
C.J. Colbourn
Affiliations and expertise
Waterloo, CanadaDJ
D. Jungnickel
Affiliations and expertise
Giessen, GermanyAR
A. Rosa
Affiliations and expertise
Hamilton, Canada