Combinatorial mathematics : proceedings of the International Colloquium on Graph Theory and Combinatorics, Marseille-Luminy, June 1981
Başlık:
Combinatorial mathematics : proceedings of the International Colloquium on Graph Theory and Combinatorics, Marseille-Luminy, June 1981
Yazar:
International Colloquium on Graph Theory and Combinatorics (2nd : 1981 : Université d'Aix-Marseille Luminy)
ISBN:
9780444865120
9780080871868
9781281797568
9786611797560
Yayın Bilgileri:
Amsterdam ; New York : North-Holland Pub. Co. ; New York, N.Y. : Sole distributors for the U.S.A. and Canada, Elsevier North-Holland, 1983.
Fiziksel Tanımlama:
1 online resource (ix, 670 pages) : illustrations.
Seri:
Annals of discrete mathematics ; 17
North-Holland mathematics studies ; 75
Annals of discrete mathematics ; 17.
North-Holland mathematics studies ; 75.
Genel Not:
Organized by the National Centre for Scientific Research, and held June 14-19, 1981, at the University of Marseille-Luminy.
İçerik:
Cover; Combinatorial Mathematics; Copyright Page; TOCContents; Preface; CHChapter 1. Extremal bases of additive permutations; CHChapter 2. Ordre minimum d'un graphe simple de diametre, degre minimum et connexite donnes; CHChapter 3. Structure des graphes de connexite k > 2 et de stabilite a = k + 2; CHChapter 4. Small embeddings of incomplete idempotent latin squares; CHChapter 5. Degrees and longest paths in bipartite digraphs; CHChapter 6. Caracterisation mediane des arbres; CHChapter 7. On the existence of D(n, p) in directed graphs; CHChapter 8. Hajós theorem for hypergraphs
CHChapter 9. Path partitions in directed graphsCHChapter 10. Grands graphes de degré et diamétre fixés; CHChapter 11. Combinatorics of incidence structures and BIB-designs; CHChapter 12. Ideal and exterior weight enumerators for linear codes: Examples and conjectures; CHChapter 13. The evolution of the cube; CHChapter 14. Construction of 4-regular graphs; CHChapter 15. A construction of a covering map with faces of even lengths; CHChapter 16. Trois types de décompositions d'un graphe en chaines; CHChapter 17. Sur les couplages dans les graphes localement finis*
CHChapter 18. A deterministic algorithm for factorizing polynomials of F, [X]CHChapter 19. On the complexities of periodic sequences; CHChapter 20. The extended Reed-Solomon codes considered as ideals of a modular algebra; CHChapter 21. Odd rooted orientations and upper-embeddable graphs; CHChapter 22. Notes on the ErdÖs-Stone theorem; CHChapter 23. Sous les pavés; CHChapter 24. Rotation numbers for unions of triangles and circuits; CHChapter 25. On cliques and partitions in Hamming spaces; CHChapter 26. Oriented matroids of rank three and arrangements of pseudolines
CHChapter 27. Etude de certains paramétres associés A un code linéaireCHChapter 28. Mots et morphismes sans carrd; CHChapter 29. Strongly qth power-free strings; CHChapter 30. Cyclic codes over GF(4) and GF(2); CHChapter 31. Some connections between groups and graphs. A survey; CHChapter 32. Algebraic codes achieving the capacity of the binary symmetric channel; CHChapter 33. Partitioning subwords of long words; CHChapter 34. The greatest angle among n points in the d-dimensional euclidean space; CHChapter 35. Edge-reconstruction of graphs with topological properties
CHChapter 36. Constructing finite sets with given intersectionsCHChapter 37. Systéme de refhence de Tremaux d'une reprksentation plane d'un graphe planaire; CHChapter 38. Sur un probleme D'erdÖs et Hajnal; CHChapter 39. La k-arboricité Iinéaire des arbres; CHChapter 40. Designs and coding theory; CHChapter 41. Le Decodage rapide des codes de Reed-Solomon et leur generalisation; CHChapter 42. Nombre maximum d'arcs d'un graphe antisymetrique sans chemin de longueur I; CHChapter 43. Trees and length functions on groups; CHChapter 44. Maximal cycles in bipartite graphs
Özet:
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.
Added Author:
Tüzel Kişi Ek Girişi:
Elektronik Erişim:
ScienceDirect http://www.sciencedirect.com/science/book/9780444865120 ScienceDirect http://www.sciencedirect.com/science/publication?issn=03040208&volume=75Mevcut:*
Yer Numarası | Demirbaş Numarası | Shelf Location | Lokasyon / Statüsü / İade Tarihi |
|---|---|---|---|
| QA164 .I57 1981 EB | 1191517-1001 | Elsevier E-Kitap Koleksiyonu | Arıyor... |
On Order
Liste seç
Bunu varsayılan liste yap.
Öğeler başarıyla eklendi
Öğeler eklenirken hata oldu. Lütfen tekrar deneyiniz.
:
Select An Item
Data usage warning: You will receive one text message for each title you selected.
Standard text messaging rates apply.