Combinatorial Mathematics

Front Cover
D. Bresson, P. Camion, J.F. Maurras, F. Sterboul, C. Berge
Elsevier, Jan 25, 2012 - Mathematics - 669 pages
1 Review
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.

 

What people are saying - Write a review

User Review - Flag as inappropriate

Absolutely stunning,Let your body long glow of spring glory! Longevity of healthy life Style from now on "practice", take a look at onlinesuprashoesforsale.com , <a href="http://www.onlinesuprashoesforsale.com/justin-bieber-supra-footwear-c-6/">Justin Bieber Supra Footwear</a> ,< 

Contents

CHChapter 44 Maximal cycles in bipartite graphs
361
CHChapter 45 Extension of Turhns and Brooks theorems and new notions of stability and coloring in digraphs
365
CHChapter 46 Symmetric representations of binary matroids
371
CHChapter 47 Sums of vectors and Turans graph problem
377
CHChapter 48 Lhypercube infini et la connexite dans les graphes infinis
383
CHChapter 49 The automorphism group of the smallest nonaffine Hall triple system
387
CHChapter 50 Un algorithme Iineaire pour Iénumération des créneaux dune suite
393
CHChapter 51 Le polynÔme de Martin dun graphe eultrien
397

CHChapter 9 Path partitions in directed graphs
59
CHChapter 10 Grands graphes de degré et diamétre fixés
65
CHChapter 11 Combinatorics of incidence structures and BIBdesigns
75
Examples and conjectures
81
CHChapter 13 The evolution of the cube
91
CHChapter 14 Construction of 4regular graphs
99
CHChapter 15 A construction of a covering map with faces of even lengths
119
CHChapter 16 Trois types de décompositions dun graphe en chaines
131
CHChapter 17 Sur les couplages dans les graphes localement finis
143
CHChapter 18 A deterministic algorithm for factorizing polynomials of F X
149
CHChapter 19 On the complexities of periodic sequences
159
CHChapter 20 The extended ReedSolomon codes considered as ideals of a modular algebra
171
CHChapter 21 Odd rooted orientations and upperembeddable graphs
177
CHChapter 22 Notes on the ErdÖsStone theorem
183
CHChapter 23 Sous les pavés
191
CHChapter 24 Rotation numbers for unions of triangles and circuits
203
CHChapter 25 On cliques and partitions in Hamming spaces
211
CHChapter 26 Oriented matroids of rank three and arrangements of pseudolines
219
CHChapter 27 Etude de certains paramétres associés A un code linéaire
225
CHChapter 28 Mots et morphismes sans carrd
235
CHChapter 29 Strongly qth powerfree strings
247
CHChapter 30 Cyclic codes over GF4 and GF2
253
CHChapter 31 Some connections between groups and graphs A survey
259
CHChapter 32 Algebraic codes achieving the capacity of the binary symmetric channel
265
CHChapter 33 Partitioning subwords of long words
271
CHChapter 34 The greatest angle among n points in the ddimensional euclidean space
275
CHChapter 35 Edgereconstruction of graphs with topological properties
285
CHChapter 36 Constructing finite sets with given intersections
289
CHChapter 37 Systéme de refhence de Tremaux dune reprksentation plane dun graphe planaire
293
CHChapter 38 Sur un probleme DerdÖs et Hajnal
303
CHChapter 39 La karboricité Iinéaire des arbres
307
CHChapter 40 Designs and coding theory
319
CHChapter 41 Le Decodage rapide des codes de ReedSolomon et leur generalisation
327
CHChapter 42 Nombre maximum darcs dun graphe antisymetrique sans chemin de longueur I
337
CHChapter 43 Trees and length functions on groups
347
CHChapter 52 tcritical hypergraphs and the Helly property
413
CHChapter 53 On certain families of disjoint perfect matchings in Kzn
419
CHChapter 54 Decompositions en chaines dun graphe complet dordre impair
427
CHChapter 55 On nedgeconnected digraphs
439
CHChapter 56 Polytope des absorbants dans une classe de graphe A seuil
443
CHChapter 57 An upper bound on covering radius
453
CHChapter 58 Sur une propriktk extreme des plans projectifs finis
459
CHChapter 59 Note sur le probléme de Heawood
465
CHChapter 60 Le nombre dabsorption du ncube
469
CHChapter 61 Sur une construction de codes sphériques
473
CHChapter 62 Symmetric inseparable double squares
483
CHChapter 63 The number of edges in a kHelly hypergraph
497
CHChapter 64 Projective geometries and their truncations
503
CHChapter 65 Trees and cuts
511
CHChapter 66 Binary self dual codes construction from self dual codes over a Galois field f2m
519
CHChapter 67 Sur un theoreme minmax en theorie des graphes
527
CHChapter 68 On two combinatorial problems arising from automata theory
535
CHChapter 69 Construction de codes autoduaux de profondeur 1 ou 2 dans A F2X1 XXi 1 X2 1
549
CHChapter 70 Cminimal snarks
559
CHChapter 71 On the generalization of the matroid parity and the matroid partition problems with applications
567
CHChapter 72 Cycle structure of affine transformations of vector spaces over GFp
575
CHChapter 73 Construction of colourcritical graphs with given majorvertex subgraph
581
CHChapter 74 Graphs and inverse semigroups
599
CHChapter 75 Colorations extremes dans les hypergraphes
605
CHChapter 76 Every tIrreducible Partial Order is A Suborder of A t + 1Irreducible Partial Order
613
CHChapter 77 Between clutters and matroids
623
CHChapter 78 A note on the existence of strong Kirkman cubes
629
CHChapter 79 On the bandwidth of random graphs
633
CHChapter 80 On the use of bichromatic interchanges
639
CHChapter 81 Extreme coloring of the edges of a graph
647
CHChapter 82 New decoding methods of the Golay code 24128
651
CHChapter 83 Uniform distribution of a subgraph in a graph
657
Chapter 84 List of problems submitted during the conferences
665
Copyright

Common terms and phrases

Bibliographic information