𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the existence of balanced bipartite designs, II

✍ Scribed by Charlotte Huang

Publisher
Elsevier Science
Year
1974
Tongue
English
Weight
935 KB
Volume
9
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The existence of court balanced tourname
The existence of court balanced tournament designs
✍ E. Mendelsohn; P. Rodney πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 564 KB

Let V be a set of n elements. A tournament design, TD(n, c), is a c-row array of the ("2) pairs of elements from V such that every element appears at most once is each column. A court balanced tournament design, CBTD(n,c), has the added property that every element appears the same number of times in

On the bipartite independence number of
On the bipartite independence number of a balanced bipartite graph
✍ Odile Favaron; Pedro Mago; Oscar Ordaz πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 603 KB

Venezuela Ap. 47567, Caracas Favaron, O., P. Mago and 0. Ordaz, On the bipartite independence number of a balanced bipartite graph, Discrete Mathematics 121 (1993) 55-63. The bipartite independence number GI aIp of a bipartite graph G is the maximum order of a balanced independent set of G. Let 6 b

Existence of Balanced Simplices on Polyt
Existence of Balanced Simplices on Polytopes
✍ Gerard van der Laan; Dolf Talman; Zaifu Yang πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 143 KB

The classic Sperner lemma states that in a simplicial subdivision of a simplex in R n and a labelling rule satisfying some boundary condition there is a completely labeled simplex. In this paper we first generalize the concept of completely labeled simplex to the concept of a balanced simplex. Using