Surveys in Combinatorics, 1991
A. D. Keedwell
Cambridge University Press, Aug 22, 1991 - Mathematics - 300 pages
This volume contains the invited papers presented at the British Combinatorial Conference, held at the University of Surrey in July 1991.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Radar Signal Patterns from Combinatorial Designs
Old and New Results on Ovals in Finite Projective Planes
Computational Methods in Design Theory
Unprovable Combinatorial Statements
Orientations and Edge Functions on Graphs
A Graph Reconstructors Manual
Turan Type Problems
adjacency matrix algebraic algorithm autocorrelation automorphism B-oval called chromatic number circuits coefficients collineation group combinatorial complete graph configurations connected graph construction contains Corollary correlation Costas Arrays cycles defined denote desarguesian planes designs diagram Discrete Math edge reconstructible eigenvalue equations Erdos ex(n example exists fc-graph Fiiredi finite set fixes an oval flow-difference Frankl function G is edge graph G Hadamard Hadamard matrices Hamiltonian graphs Hence Hi(G hypergraph hyperoval implies intersection involutions isomorphic Korchmaros length Let G linear lower bound maximal index maximum ordinal numbers orientation orthogonal pair partition Pascal Peano Peano Arithmetic Peano Axioms permutation group perturbation plane of order points positive integers primitive recursive problem projective plane proof proved Reconstruction Conjecture reconstruction of G result root Schubert polynomials sequence signal spanning subgraphs subgraph subgraphs of G subset symmetric Theorem theory tree Turan unprovability upper bound values vectors vertex vertices