Fr. 49.90

Combinatorial Mathematics VIII - Proceedings of the Eighth Australian Conference on Combinatorial Mathematics Held at Deakin University, Geelong, Australia, August 25-29, 1980

English · Paperback / Softback

Shipping usually within 1 to 2 weeks (title will be printed to order)

Description

Read more










Some properties of H-designs.- Computation of some number-theoretic coverings.- The search for long paths and cycles in vertex-transitive graphs and digraphs.- On strongly hamiltonian abelian group graphs.- Monochromatic lines in partitions of Zn.- Complete stable marriages and systems of I-M preferences.- The construction of finite projective planes.- A survey of graph generation techniques.- Graphs and two-distance sets.- Finite Ramsey theory is hard.- Further results on coverin integers of the form 1+k2N by primes.- Distributive block structures and their automorphisms.- Connected subgraphs of the graph of multigraphic realisations of a degree sequence.- A construction for a family of sets and its application to matroids.- Regularity and optimality for trees.- Simple and multigraphic realizations of degree sequences.- Critical link identification in a network.- Enumeration of binary phylogenetic trees.- Minimisatin of multiple entry finite automata.- A singular direct product for quadruple systems.- The maximum number of intercalates in a latin square.- Elegant odd rings and non-planar graphs.- On critical sets of edges in graphs.- Further evidence for a conjecture on two-point deleted subgraphs of cartesian products.- Deques, trees and lattice paths.- Graeco-latin and nested row and column designs.- Contrained switchings in graphs.- One-factorisations of wreath products.- Divisible semisymmetric designs.- Graphs and universal algebras.- Universal fabrics.

List of contents

Some properties of H-designs.- Computation of some number-theoretic coverings.- The search for long paths and cycles in vertex-transitive graphs and digraphs.- On strongly hamiltonian abelian group graphs.- Monochromatic lines in partitions of Zn.- Complete stable marriages and systems of I-M preferences.- The construction of finite projective planes.- A survey of graph generation techniques.- Graphs and two-distance sets.- Finite Ramsey theory is hard.- Further results on coverin integers of the form 1+k2N by primes.- Distributive block structures and their automorphisms.- Connected subgraphs of the graph of multigraphic realisations of a degree sequence.- A construction for a family of sets and its application to matroids.- Regularity and optimality for trees.- Simple and multigraphic realizations of degree sequences.- Critical link identification in a network.- Enumeration of binary phylogenetic trees.- Minimisatin of multiple entry finite automata.- A singular direct product for quadruple systems.- The maximum number of intercalates in a latin square.- Elegant odd rings and non-planar graphs.- On critical sets of edges in graphs.- Further evidence for a conjecture on two-point deleted subgraphs of cartesian products.- Deques, trees and lattice paths.- Graeco-latin and nested row and column designs.- Contrained switchings in graphs.- One-factorisations of wreath products.- Divisible semisymmetric designs.- Graphs and universal algebras.- Universal fabrics.

Product details

Assisted by K L McAvaney (Editor), K. L. McAvaney (Editor)
Publisher Springer, Berlin
 
Languages English
Product format Paperback / Softback
Released 29.06.2009
 
EAN 9783540108832
ISBN 978-3-540-10883-2
No. of pages 360
Dimensions 157 mm x 235 mm x 22 mm
Weight 606 g
Illustrations XVI, 360 p.
Series Lecture Notes in Mathematics
Lecture Notes in Mathematics
Subjects Children's and young people's books > Young people's books from 12 years of age
Natural sciences, medicine, IT, technology > Mathematics > Miscellaneous

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.