Combinatorial Mathematics VIII
Proceedings of the Eighth Australian Conference on Combinatorial Mathematics Held at Deakin University, Geelong, Australia, August 25-29, 1980
Series: Lecture Notes in Mathematics; 884;
- Publisher's listprice EUR 37.40
-
15 511 Ft (14 773 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 3 102 Ft off)
- Discounted price 12 409 Ft (11 818 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
15 511 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 1981
- Publisher Springer Berlin Heidelberg
- Date of Publication 1 October 1981
- Number of Volumes 1 pieces, Book
- ISBN 9783540108832
- Binding Paperback
- No. of pages360 pages
- Size 235x155 mm
- Weight 1160 g
- Language English
- Illustrations XVI, 360 p. Illustrations, black & white 0
Categories
Table 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.
More
