What people are saying - Write a review
We haven't found any reviews in the usual places.
variations on a theme
Flats in matroids and geometric graphs
Combinatorial characterization theorems for geometric
4 other sections not shown
Other editions - View all
2-design abelian adjacent affine space block design block space called Cayley graph characterization chromatic polynomial codewords coefficient Combinatorial Theory conjecture construction defined deleting denote digon disjoint dual edges of G embedded example exists extendable extremal code finite flat G(it generalised projective genus geometric graph graph G Graph Theory hypermatroid hyperplane imbed incidence structure induction intersection isomorphic lattice packing Let G line graph linear code linear space lower subspace Math matroid matroid structure Mobius plane near-triangulation non-zero nonorientable number of points obtained Open Problem orientable parallelism parameters plane of order prime power projective geometry projective plane projective space proof of Theorem properties Proposition proved rank Ray-Chaudhuri result satisfies self-dual codes self-dual lattice set of points simple graph Sloane spanned sphere sphere-packing Sprague strongly regular graph subset symmetric design T-critical graph theta-function triangulation underlying matroid vectors vertex set vertices weight enumerator zero