Combinatorial mathematics: Proceedings of the International Colloquium on Graph Theory and Combinatorics, Marseille-Luminy, June 1981 (Annals of discrete mathematics)

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. Content: Edited by Pages ii-iii Copyright page Page iv Preface Page v Extremal Bases of Additive Permutations Original Research Article Pages 1-5 Jaromir Abrham, Anton Kotzig Ordre Minimum D'un Graphe Simple De Diametre, Degre Minimum Et Connexite Donnes Original Research Article Pages 7-10 Denise Amar, Irène Fournier, Anne Germa Structure Des Graphes De Connexite k ≥ 2 Et De Stabilite α = k + 2 Original Research Article Pages 11-17 Denise Amar, Irène Fournier, Anne Germa Small Embeddings of Incomplete Idempotent Latin Squares Original Research Article Pages 19-31 L.D. Andersen, A.J.W. Hilton, C.A. Rodger Degrees and Longest Paths in Bipartite Digraphs Original Research Article Pages 33-38 Jacqueline Ayel Caracterisation Mediane Des Arbres Original Research Article Pages 39-46 Jean–Pierre Barthelemy On the Existence of D ( n,p ) in Directed Graphs Original Research Article Pages 47-52 A. Benhocine, A.P. Wojda Hajós' Theorem for Hypergraphs Original Research Article Pages 53-57 C. Benzaken Path Partitions in Directed Graphs Original Research Article Pages 59-63 C. Berge Grands Graphes De Degré Et Diamètre Fixés Original Research Article Pages 65-73 J.-C. Bermond, C. Delorme, J.-J. Quisquater Combinatorics of Incidence Structures and Bib-Designs Original Research Article Pages 75-80 Carlo Bernasconi Ideal and Exterior Weight Enumerators for Linear Codes: Examples and Conjectures Original Research Article Pages 81-90 Kenneth P. Bogart The Evolution of the Cube Original Research Article Pages 91-97 Béla Bollobás Construction of 4-Regular Graphs Original Research Article Pages 99-118 Francette Bories, Jean-Loup Jolivet, Jean-Luc Fouquet A Construction of a Covering Map with Faces of Even Lengths Original Research Article Pages 119-130 A. Bouchet Trois Types De Décompositions D'un Graphe En Chaînes Original Research Article Pages 131-141 André Bouchet, Jean-Luc Fouquet Sur Les Couplages Dans Les Graphes Localement Finis Original Research Article Pages 143-147 François Bry A Deterministic Algorithm for Factorizing Polynomials of F q [ X ] Original Research Article Pages 149-157 Paul Camion On the Complexities of Periodic Sequences Original Research Article Pages 159-170 Agnes H. Chan, Richard A. Games, Edwin L. Key The Extended Reed-Solomon Codes Considered as Ideals or a Modular Algebra Original Research Article Pages 171-176 Pascale Charpin Odd Rooted Orientations and Upper-Embeddable Graphs Original Research Article Pages 177-181 O. Chevalier, F. Jaeger, C. Payan, N.H. Xuong Notes on the Erdös-Stone Theorem Original Research Article Pages 183-190 V. Chvátal, E. Szemerédi Sous Les Pavés... Original Research Article Pages 191-202 M. Cochand, P. Duchet Rotation Numbers for Unions of Triangles and Circuits Original Research Article Pages 203-209 E.J. Cockayne, Fang Zu Yao On Cliques and Partitions in Hamming Spaces Original Research Article Pages 211-217 Gérard Cohen, Peter Frankl Oriented Matroids of Rank Three and Arrangements of Pseudolines Original Research Article Pages 219-223 Raul Cordovil Etude De Certains Paramètres Associés `Un Code Linéaire Original Research Article Pages 225-233 B. Courteau, G. Fournier, R. Fournier Mots Et Morphismes Sans Carré Original Research Article Pages 235-245 M. Crochemore Strongly q th Power–Free Strings Original Research Article Pages 247-252 L.J. Cummings Cyclic Codes Over Gf(4) and Gf(2) Original Research Article Pages 253-258 Gilbert Delclos Some Connections Between Groups and Graphs. A Survey Original Research Article Pages 259-263 J. Dénes Algebraic Codes Achieving the Capacity of the Binary Symmetric Channel Original Research Article Pages 265-269 Ph. Delsarte, Ph. Piret Partitioning Subwords of Long Words Original Research Article Pages 271-274 Walter Deuber The Greatest Angle Among n Points in the d - Dimensional Euclidean Space Original Research Article Pages 275-283 P. Erdös, Z. Füredi Edge-Reconstruction of Graphs With Topological Properties Original Research Article Pages 285-288 S. Fiorini, J. Lauri Constructing Finite Sets With Given Intersections Original Research Article Pages 289-291 Peter Frankl Système De Reference De Tremaux D'une Representation Plane D'Un Graphe Planaire Original Research Article Pages 293-302 H. De Fraysseix, P. Rosenstiehl Sur un Probleme D'Erdös Et Hajnal Original Research Article Pages 303-306 Guy Giraud La k -Arboricité Linéaire Des Arbres Original Research Article Pages 307-317 M. Habib, B. Peroche Designs and Coding Theory Original Research Article Pages 319-326 Marshall Hall Jr. Le Decodage Rapide Des Codes De Reed-Solomon Et Leur Generalisation Original Research Article Pages 327-336 S. Harari Nombre Maximum D'arcs D'un Graphe Antisymetrique Sans Chemin De Longueur 1 Original Research Article Pages 337-346 M.C. Heydemann Trees and Length Functions on Groups Original Research Article Pages 347-359 Wilfried Imrich, Gabriele Schwarz Maximal Cycles in Bipartite Graphs Original Research Article Pages 361-363 Bill Jackson Extension of Turan's and Brooks' Theorems and New Notions of Stability and Coloring in Digraphs Original Research Article Pages 365-370 H. Jacob, H. Meyniel Symmetric Representations of Binary Matroids Original Research Article Pages 371-376 F. Jaeger Sums of Vectors and Turán's Graph Problem Original Research Article Pages 377-382 G.O.H. Katona L'Hypercube Infini Et La Connexite Dans Les Graphes Infinis Original Research Article Pages 383-386 Jean-Marie Laborde The Automorphism Group of the Smallest Non-Affine Hall Triple System Original Research Article Pages 387-391 J. Lacaze, L. Beneteau Un Algorithme Linéaire Pour L'Énumération Des Créneaux D'une Suite Original Research Article Pages 393-395 Abkelkader Lahrichi, Jean Luc Seret Le Polynôme De Martin D'un Graphe Eulerien Original Research Article Pages 397-411 Michel Las Vergnas τ–Critical Hypergraphs and the Helly Property Original Research Article Pages 413-418 J. Lehel On Certain Families of Disjoint Perfect Matchings in K 2n Original Research Article Pages 419-426 André Lentin Decompositions En Chaines D'un Graphe Complet D'ordre Impair Original Research Article Pages 427-438 R. López Bracho On N –Edge–Connected Digraphs Original Research Article Pages 439-441 W. Mader Polytope Des Absorbants Dans Une Classe De Graphe a Seuil Original Research Article Pages 443-452 Ali Ridha Mahjoub An Upper Bound on Covering Radius Original Research Article Pages 453-458 H.F. Mattson Jr. Sur Une Propriete Extreme Des Plans Projectifs Finis Original Research Article Pages 459-463 Jean François Maurras Note Sur Le Problème De Heawood Original Research Article Pages 465-468 Jean Mayer Le Nombre D'Absorption Du n –Cube Original Research Article Pages 469-472 M. Mollard Sur Une Construction De Codes Sphériques Original Research Article Pages 473-481 B. Montaron Symmetric Inseparable Double Squares Original Research Article Pages 483-496 Annie–Françoise Mouyart The Number of Edges in a k –Helly Hypergraph Original Research Article Pages 497-501 Henry Martyn Mulder Projective Geometries and their Truncations Original Research Article Pages 503-510 U.S.R. Murty Trees and Cuts Original Research Article Pages 511-517 Manfred W. Padberg, Laurence A. Wolsey Binary Self Dual Codes Construction from Self Dual Codes Over a Galois Field F 2 m Original Research Article Pages 519-526 G. Pasquier Sur un Theoreme Min-Max En Theorie Des Graphes (D'Après L. Nebeský) Original Research Article Pages 527-533 C. Payan, N.H. Xuong On two Combinatorial Problems Arising from Automata Theory Original Research Article Pages 535-548 J.E. Pin Construction De Codes Autoduaux De Profondeur 1 Ou 2 Dans A = F 2 [ X 19 ..., X n ]( X 2/1−1,...., X 2/ n –1) Original Research Article Pages 549-557 A. Poli, M. Ventou C-Minimal Snarks Original Research Article Pages 559-565 Myriam Preissmann On the Generalization of the Matroid Parity and the Matroid Partition Problems, With Applications Original Research Article Pages 567-573 András Recski Cycle Structure of Affine Transformations of Vector Spaces Over Gf(P) Original Research Article Pages 575-579 I.G. Rosenberg Construction of Colour-Critical Graphs With Given Major-Vertex Subgraph Original Research Article Pages 581-598 Horst Sachs, Michael Stiebitz Graphs and Inverse Semigroups Original Research Article Pages 599-603 S.C. Shee, H.H. Teh Colorations Extrêmes Dans Les Hypergraphes Original Research Article Pages 605-612 F. Sterboul, D. Wertheimer Every t -Irreducible Partial Order is a Suborder of a t + Irreducible Partial Order Original Research Article Pages 613-621 William T. Trotter Jr., Jeffrey A. Ross Between Clutters and Matroids Original Research Article Pages 623-628 Paul Vaderlind A Note on the Existence of Strong Kirkman Cubes Original Research Article Pages 629-632 S.A. Vanstone On the Bandwidth of Random Graphs Original Research Article Pages 633-638 W. Fernandez de la Véga On the use of Bichromatic Interchanges Original Research Article Pages 639-646 D. de Werra Extreme Coloring of the Edges of a Graph Original Research Article Pages 647-649 D. Wertheimer New Decoding Methods of the Golay Code (24, 12, 8) Original Research Article Pages 651-656 J. Wolfmann Uniform Distribution of a Subgraph in a Graph Original Research Article Pages 657-664 Thomas Zaslavsky List of Problems Submitte Dduring the Conferences Pages 665-670 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