A Survey of Combinatorial TheoryThe papers included in this volume were solicited and presented at a symposium in honor of Professor R. C. Bose in 1971, who has been active in mathematics and statistics since 1926. While his interest in coding theory is recent, it is expected to continue as he remains active as a mathematician. |
Contents
Balanced hypergraphs and some applications to graph theory | 15 |
Characterization problems of combinatorial graph theory | 31 |
Lineminimal graphs with cyclic group | 59 |
Copyright | |
18 other sections not shown
Other editions - View all
Common terms and phrases
a₁ adjacent Algebra association scheme asymmetrical factorial B₁ balanced array balanced incomplete block bibd binary Canad clique columns conjecture consider construction contains corresponding D. K. Ray-Chaudhuri d₁ defined denote digraphs distinct distribution edges elements Erdös error exists factorial designs finite fractional replicates GF(q given graph G Harary Hence hypergraph incidence matrix incomplete block designs intersect k₁ lattice Lemma line graph line-minimal linear lower bound majority decoding Math methods n₁ number theory obtained order statistics orthogonal array P₁ p₁₁ pair parameters parity check partial geometry partially balanced points polynômes polynomial prime Proc projective plane proof properties proved R. C. Bose random variables Rényi S. S. Shrikhande S₁ S₂ satisfies sequence sorting network Srivastava strongly regular graph subset symmetric T₁ Theorem treatments values vertex vertices W. T. Tutte X₁