## Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 10Utilitas Mathematica Pub, 1979 - Combinatorial analysis |

### What people are saying - Write a review

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

### Contents

F R K Chung P Erdos R L Graham S M Ulam and F F | 3 |

P ErdSs | 19 |

Hall | 39 |

Copyright | |

49 other sections not shown

### Other editions - View all

### Common terms and phrases

10TH S-E CONF adjacent algebraic algorithm alignment antichain automorphism BIBD binary binary matrix blocks called cocycles column COMBINATORICS Complete Graphs complete Latin squares computation conjecture connected consider construction contains convex convex sets Corollary cycle structure cyclic defined denote designs disjoint doubly symmetric elements Euler tour eulerian exists expected number Figure finite follows GD difference GF(q given graph G Graph Theory Hamiltonian cycle Hence homomorphism incidence structures integer intersection isomorphic labelled Lemma length Let G lines lower bound Math matrix maximal minimal NC*C number of gaps obtain pair partition planar plane of order points polynomial positive integer problem PROC projective planes Proof quasifields R-labels random graphs refinement route system row complete Latin satisfying sequence shortest path similarity relations Southeastern Conference square of order station Steinhaus graph subgraph subset subspace Suppose Theorem tight cell tight set translation planes tree triangle values vertex vertices