Surveys in Combinatorics 2003C. D. Wensley Cambridge University Press, 24 de jul. 2003 - 370 pàgines The British Combinatorial Conference is held every two years and is a key event for mathematicians worldwide working in combinatorics. In June 2003 the conference was held at the University of Wales, Bangor. The papers contained here are surveys contributed by the invited speakers and are of the high quality that befits the event. There is also a tribute to Bill Tutte who had a long-standing association with the BCC. The papers cover topics currently attracting significant research interest as well as some less traditional areas such as the combinatorics of protecting digital content. They will form an excellent resource for established researchers as well as graduate students who will find much here to inspire future work. |
Continguts
WT Tutte 19172002 | 1 |
Decompositions of complete graphs embedding partial edgecolourings and the method of amalgamations | 7 |
Combinatorial schemes for protecting digital content | 43 |
Matroids and Coxeter groups | 79 |
Defining sets in combinatorics a survey | 115 |
Finite projective planes with a large abelian group | 175 |
Algorithmic aspects of graph homomorphisms | 239 |
Counting lattice triangulations | 277 |
Partition regular equations | 309 |
KostkaFoulkes polynomials and Macdonald spherical functions | 325 |
Frases i termes més freqüents
affine difference set algebraic algorithm amalgamations Anne Penfold bipartite blocks codewords collineation group colour class combinatorial complete graph Comput conjecture contains Corollary Coxeter group Coxeter matroids cyclic decomposition denote desarguesian desarguesian planes desc(X Discrete Math edge-colouring edges element embedding example exists finite flag matroid forcing number frameproof codes geometry graph G group G group ring H-colouring problem homomorphism integer isomorphic Jungnickel k-IPP code Kostka-Foulkes polynomials latin square Lemma loops matroid matroid polytope maximal minimal defining set multiplier NP-complete one-factors pair partial latin square partition regular permutation planar difference set plane of order polynomial polytope projective plane proof proved relative difference sets result semifield semimodular lattice semiplane smallest defining sets Steiner triple systems subgraph subgroup subset symmetric symplectic matroid T₁ Theorem theory trade traitor tracing treewidth unimodular triangulations unique v₁ vector vertex vertices