## Combinatorics, Volume 1987Leading combinatorialists from around the world contributed to this volume. The plenary lecturers were the following: J. Beck (on combinatorial games), B. Bollobaacute;s (on cycles in random graphs), A. Brouwer (on extremal design theory), P. Erdodblac;s (on problems and results in combinatorics), C. Godsil (on the application of linear algebra in combinatorics), L. Lovaacute;sz (on matching theory), A.A. Razborov (on Boolean complexity), M. Saks (on collective coin flipping), and A. Schrijver (on disjoint paths in graphs). |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Contents | 7 |

Minimal forbidden | 49 |

On the irregularities of point sets in the unit square | 63 |

Copyright | |

45 other sections not shown

### Other editions - View all

### Common terms and phrases

2-connected 6-matching A-matroid adjacent adversary algorithm arcs assume Azuma's inequality bipartite graph bits block Budapest coin flipping COLLOQUIA MATHEMATICA SOCIETATIS colour COMBINATORICS complete graph components Computer conjecture consider construction contradiction Corollary cycle of length defined deleted Dept diameter digraph dishonest players disjoint distance-regular antipodal covers distance-regular graphs EGER HUNGARY exists forms graph function G contains graph G graph of order Graph Theory hamiltonian Hamiltonian cycle Hamiltonian path Hence Hungary implies independent induced subgraph inequality integer isomorphic jANOS BOLYAI jANOS BOLYAI 52 labelled least Lemma Let G linear Math MATHEMATICA SOCIETATIS jANOS Mathematics matrix matroid maximum minimal forbidden minor non-negative obtained pair partition path points polynomial problem proof of Theorem Proposition prove quasi-symmetric random graphs result satisfies semi-random source SOCIETATIS jANOS BOLYAI subset subspaces Suppose symmetric t-join Theorem trees triangles Univ vector vertex vertex set vertices of G weight