Combinatorial Mathematics V.

Proceedings of the Fifth Australian Conference, Held at the Royal Melbourne Institute of Technology, August 24 - 26, 1976.
Herausgegeben:Little, C. H. C.

• Broschiertes Buch

Produktbeschreibung

Subgroup theorems and graphs.- Counting unlabeled acyclic digraphs.- Golay sequences.- The knotted hexagon.- On skew room squares.- Some new constructions for orthogonal designs using circulants.- A note on asymptotic existence results for orthogonal designs.- The spectrum of a graph.- Latin squares composed of four disjoint subsquares.- The semi-stability of lexicographic products.- On rings of circuits in planar graphs.- Sum-free sets in loops.- Groups with stable graphs.- 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).- Orthogonal designs in order 24.- A schr¿der triangle: Three combinatorial problems.- A combinatorial approach to map theory.- On quasi-multiple designs.- A generalisation of the binomial coefficients.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Mathematics 622
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-08524-9
• 1977
• Seitenzahl: 220
• Erscheinungstermin: 1. November 1977
• Englisch
• Abmessung: 235mm x 155mm x 13mm
• Gewicht: 368g
• ISBN-13: 9783540085249
• ISBN-10: 3540085246
• Artikelnr.: 23561839

Inhaltsangabe

Subgroup theorems and graphs.- Counting unlabeled acyclic digraphs.- Golay sequences.- The knotted hexagon.- On skew room squares.- Some new constructions for orthogonal designs using circulants.- A note on asymptotic existence results for orthogonal designs.- The spectrum of a graph.- Latin squares composed of four disjoint subsquares.- The semi-stability of lexicographic products.- On rings of circuits in planar graphs.- Sum-free sets in loops.- Groups with stable graphs.- 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).- Orthogonal designs in order 24.- A schröder triangle: Three combinatorial problems.- A combinatorial approach to map theory.- On quasi-multiple designs.- A generalisation of the binomial coefficients.