Titlebook: Combinatorial Mathematics VII; Proceedings of the S Robert W. Robinson,George W. Southern,Walter D. Wa Conference proceedings 1980 Springer

無可爭辯

Spartan

Doubly and orthogonally resolvable quadruple systems,of X is contained in precisely λ blocks. A . of order v is a Steiner system S.(3,4,v). A triple (X,β,γ) is called an (s,μ)-. if for some s

Tdd526

Establishing the minimality of phylogenetic trees from protein sequences, note we consider some new techniques developed to enable researchers to analyse such trees on larger data sets. The basic principle involved is to split the problem into a number of smaller problems which can be more easily handled. Much of the work is described in graph theoretic terms, but no dee

仔細檢查

Balanced ternary designs with block size three,ock. The condition . (mod 3) is shown to be both necessary and sufficient for the existence of a BTD on . elements with block size 3 and index 2 in which each element is repeated in exactly one block and each element occurs in a constant number of blocks.

缺陷

https://doi.org/10.1007/BFb0088895Hypergraph; Kombinatorik; Mathematics; Ramsey theory; algorithms; graphs; combinatorics

Encoding

978-3-540-10254-0Springer-Verlag Berlin Heidelberg 1980

mechanical

Combinatorial Mathematics VII978-3-540-38376-5Series ISSN 0075-8434 Series E-ISSN 1617-9692

chemoprevention

ELUC

周年紀念日

Sleep, Benzodiazepines and Performance note we consider some new techniques developed to enable researchers to analyse such trees on larger data sets. The basic principle involved is to split the problem into a number of smaller problems which can be more easily handled. Much of the work is described in graph theoretic terms, but no deep results of graph theory are called upon.