Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 10Utilitas Mathematica Pub, 1979 - Combinatorial analysis |
Contents
F R K Chung P Erdös R L Graham S M Ulam and F F | 3 |
Some Old and New Problems in Various Branches of Combinatorics | 19 |
Hall | 39 |
Copyright | |
45 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 binomial type blocks C₁ called cocycles column Combinatorial Theory COMBINATORICS Complete Graphs complete Latin squares computation conjecture consider construction contains convex Corollary cyclic d₁ d₂ defined denote designs disjoint doubly symmetric edges elements Euler tour eulerian exists Figure finite follows GF(q given graph G Graph Theory Hamiltonian Hamiltonian cycle Hence incidence structures intersection isomorphic labelled Lemma length Let G lines Math matrix maximal minimal n-tuples NC*C number of gaps obtain orthogonal pair partition planar plane of order points polynomial positive integer problem PROC projective planes Proof quasifields R-labels refinement route system satisfying sequence shortest path similarity relations square of order starter station Steiner triple systems Steinhaus graph subgraph subset subspace Suppose Theorem tight cells tight set translation planes tree triangle values vertex vertices