Proceedings of the Southeastern Conference on Combinatorics, Graph Theory, and Computing, Volume 4Utilitas Mathematica Pub, 1973 - Combinatorial analysis |
From inside the book
Results 1-3 of 52
Page 36
... pair of elements from distinct V one of the sets Wij · Moreover с is contained in exactly I W i j the pairs i , j and Wi | = m + 1 s ( s - ' ij ' t ) pairs . Replacing lowing well known result : m + i Lemma 2. Let V be a set of = m + 2 ...
... pair of elements from distinct V one of the sets Wij · Moreover с is contained in exactly I W i j the pairs i , j and Wi | = m + 1 s ( s - ' ij ' t ) pairs . Replacing lowing well known result : m + i Lemma 2. Let V be a set of = m + 2 ...
Page 521
... pair of distinct objects from S ; ( ii ) Each symbol occurs in every row ( column ) of the array ; ( iii ) Every unordered pair of symbols occurs precisely once in the array . Because of the announcement of the existence of a Room ...
... pair of distinct objects from S ; ( ii ) Each symbol occurs in every row ( column ) of the array ; ( iii ) Every unordered pair of symbols occurs precisely once in the array . Because of the announcement of the existence of a Room ...
Page 523
... pair of ) subsquare ( s ) of side V3 , then there exists a skew ( pair of complementary ) Room square ( s ) of side V1 ( V2 - V3 ) + V3 taining skew ( complementary pairs of ) subsquares of side V1 , V2 If there is a skew ...
... pair of ) subsquare ( s ) of side V3 , then there exists a skew ( pair of complementary ) Room square ( s ) of side V1 ( V2 - V3 ) + V3 taining skew ( complementary pairs of ) subsquares of side V1 , V2 If there is a skew ...
Other editions - View all
Common terms and phrases
2-colorable 4TH S-E CONF abelian group adjacent algorithm array of order balanced incomplete block Baumert-Hall arrays bicritical binary bipartite graph block design boundary colorations braid chain-groups circuit Combinatorial Theory conjecture consider construction contains core cycle defined definition denote digits edges elements equation example exist finite four coloring given graph G Graph Theory Hadamard matrices hamiltonian Hamiltonian graphs Hence hypergraph incidence geometry incidence matrix incomplete block design integer isomorphic Jennifer Seberry Jennifer Wallis k-tuples labeled Lemma lower bound Math matroid maximal snakes minimal n-set nodes obtained occurs pair parameters partially ordered set partition perfect 1-factorization permutation permutation groups planar graph polynomial prime power problem PROC Proof reduced sequences Room square SAN DIEGO satisfy skew Stanton starter subcube subset Suppose symmetric snake T-sequence tactical configurations Theorem tree University upper bound values vertices wreath