Combinatorial Mathematics
Published on 25. January 2012
669 pages
978-0-08-087186-8 (ISBN)
Description
The object of this book is to provide an account of the results and methods used in combinatorial theories: Graph Theory, Matching Theory, Hamiltonian Problems, Hypergraph Theory, Designs, Steiner Systems, Latin Squares, Coding Matroids, Complexity Theory.In publishing this volume, the editors do not intend to discuss all the classical open problems in combinatorics for which an algebraic approach turns out to be useful. The work is a selection which is intended for specialists, as well as for graduate students who may also be interested in survey papers. The work features a special section which contains a list of unsolved problems proposed by the participants.
More details
Other editions
Additional editions
Book
09/1983
Elsevier
€120.49
Article exhausted; check different version
Content
- Cover
- Combinatorial Mathematics
- Copyright Page
- TOC$Contents
- Preface
- CH$Chapter 1. Extremal bases of additive permutations
- CH$Chapter 2. Ordre minimum d'un graphe simple de diametre, degre minimum et connexite donnes
- CH$Chapter 3. Structure des graphes de connexite k & 2 et de stabilite a = k + 2
- CH$Chapter 4. Small embeddings of incomplete idempotent latin squares
- CH$Chapter 5. Degrees and longest paths in bipartite digraphs
- CH$Chapter 6. Caracterisation mediane des arbres
- CH$Chapter 7. On the existence of D(n, p) in directed graphs
- CH$Chapter 8. Hajós theorem for hypergraphs
- CH$Chapter 9. Path partitions in directed graphs
- CH$Chapter 10. Grands graphes de degré et diamétre fixés
- CH$Chapter 11. Combinatorics of incidence structures and BIB-designs
- CH$Chapter 12. Ideal and exterior weight enumerators for linear codes: Examples and conjectures
- CH$Chapter 13. The evolution of the cube
- CH$Chapter 14. Construction of 4-regular graphs
- CH$Chapter 15. A construction of a covering map with faces of even lengths
- CH$Chapter 16. Trois types de décompositions d'un graphe en chaines
- CH$Chapter 17. Sur les couplages dans les graphes localement finis*
- CH$Chapter 18. A deterministic algorithm for factorizing polynomials of F, [X]
- CH$Chapter 19. On the complexities of periodic sequences
- CH$Chapter 20. The extended Reed-Solomon codes considered as ideals of a modular algebra
- CH$Chapter 21. Odd rooted orientations and upper-embeddable graphs
- CH$Chapter 22. Notes on the ErdÖs-Stone theorem
- CH$Chapter 23. Sous les pavés
- CH$Chapter 24. Rotation numbers for unions of triangles and circuits
- CH$Chapter 25. On cliques and partitions in Hamming spaces
- CH$Chapter 26. Oriented matroids of rank three and arrangements of pseudolines
- CH$Chapter 27. Etude de certains paramétres associés A un code linéaire
- CH$Chapter 28. Mots et morphismes sans carrd
- CH$Chapter 29. Strongly qth power-free strings
- CH$Chapter 30. Cyclic codes over GF(4) and GF(2)
- CH$Chapter 31. Some connections between groups and graphs. A survey
- CH$Chapter 32. Algebraic codes achieving the capacity of the binary symmetric channel
- CH$Chapter 33. Partitioning subwords of long words
- CH$Chapter 34. The greatest angle among n points in the d-dimensional euclidean space
- CH$Chapter 35. Edge-reconstruction of graphs with topological properties
- CH$Chapter 36. Constructing finite sets with given intersections
- CH$Chapter 37. Systéme de refhence de Tremaux d'une reprksentation plane d'un graphe planaire
- CH$Chapter 38. Sur un probleme D'erdÖs et Hajnal
- CH$Chapter 39. La k-arboricité Iinéaire des arbres
- CH$Chapter 40. Designs and coding theory
- CH$Chapter 41. Le Decodage rapide des codes de Reed-Solomon et leur generalisation
- CH$Chapter 42. Nombre maximum d'arcs d'un graphe antisymetrique sans chemin de longueur I
- CH$Chapter 43. Trees and length functions on groups
- CH$Chapter 44. Maximal cycles in bipartite graphs
- CH$Chapter 45. Extension of Turhn's and Brooks' theorems and new notions of stability and coloring in digraphs
- CH$Chapter 46. Symmetric representations of binary matroids
- CH$Chapter 47. Sums of vectors and Turan's graph problem
- CH$Chapter 48. L'hypercube infini et la connexite dans les graphes infinis
- CH$Chapter 49. The automorphism group of the smallest non-affine Hall triple system
- CH$Chapter 50. Un algorithme Iineaire pour I'énumération des créneaux d'une suite
- CH$Chapter 51. Le polynÔme de Martin d'un graphe eultrien
- CH$Chapter 52. t-critical hypergraphs and the Helly property
- CH$Chapter 53. On certain families of disjoint perfect matchings in Kzn
- CH$Chapter 54. Decompositions en chaines d'un graphe complet d'ordre impair
- CH$Chapter 55. On n-edge-connected digraphs
- CH$Chapter 56. Polytope des absorbants dans une classe de graphe A seuil
- CH$Chapter 57. An upper bound on covering radius
- CH$Chapter 58. Sur une propriktk extreme des plans projectifs finis
- CH$Chapter 59. Note sur le probléme de Heawood
- CH$Chapter 60. Le nombre d'absorption du n-cube
- CH$Chapter 61. Sur une construction de codes sphériques
- CH$Chapter 62. Symmetric inseparable double squares
- CH$Chapter 63. The number of edges in a k-Helly hypergraph
- CH$Chapter 64. Projective geometries and their truncations
- CH$Chapter 65. Trees and cuts
- CH$Chapter 66. Binary self dual codes construction from self dual codes over a Galois field f2m
- CH$Chapter 67. Sur un theoreme min-max en theorie des graphes
- CH$Chapter 68. On two combinatorial problems arising from automata theory
- CH$Chapter 69. Construction de codes autoduaux de profondeur 1 ou 2 dans A = F2[X1,....., X,]/(Xi -1,........, X2 - 1)
- CH$Chapter 70. C-minimal snarks
- CH$Chapter 71. On the generalization of the matroid parity and the matroid partition problems, with applications
- CH$Chapter 72. Cycle structure of affine transformations of vector spaces over GF(p)*
- CH$Chapter 73. Construction of colour-critical graphs with given major-vertex subgraph
- CH$Chapter 74. Graphs and inverse semigroups
- CH$Chapter 75. Colorations extremes dans les hypergraphes
- CH$Chapter 76. Every t-Irreducible Partial Order is A Suborder of A t + 1-Irreducible Partial Order
- CH$Chapter 77. Between clutters and matroids
- CH$Chapter 78. A note on the existence of strong Kirkman cubes
- CH$Chapter 79. On the bandwidth of random graphs
- CH$Chapter 80. On the use of bichromatic interchanges
- CH$Chapter 81. Extreme coloring of the edges of a graph
- CH$Chapter 82. New decoding methods of the Golay code (24,12,8)
- CH$Chapter 83. Uniform distribution of a subgraph in a graph
- Chapter 84. List of problems submitted during the conferences
