Proceedings of the British Combinatorial ConferenceUtilitas Mathematica Pub., 1977 - Combinatorial analysis |
Contents
variations on a theme | 23 |
Flats in matroids and geometric graphs | 45 |
Combinatorial characterization theorems for geometric | 87 |
Copyright | |
4 other sections not shown
Other editions - View all
Common terms and phrases
2-design abelian adjacent affine space block design block space called Cayley graph characterization chromatic polynomial codewords Combinatorial Theory conjecture construction contained covering defined deleting denote digon dimension disjoint dual edges of G embedded example exists extension extremal code finite G₁ G₂ generalised projective genus geometric graph graph G Graph Theory hamiltonian hypermatroid hyperplane imbed incidence structure intersection isomorphic lattice packing Let G line graph linear code linear space lower subspace Math matroid matroid structure minimum near-triangulation non-zero nonorientable number of points obtained orientable parallelism parameters plane of order prime power projective geometry projective plane projective space properties Proposition proved rank Ray-Chaudhuri result S₁ satisfies self-dual codes self-dual lattice set of points simple graph Sloane spanned sphere sphere-packing strongly regular graph subset symmetric design T-critical graph theta-function triangulation underlying matroid vectors vertex set vertices weight enumerator zero