|
|
 |
| Авторизация |
|
|
|
| Поиск по указателям |
|
|
|
|
|
|
|
 |
|
|
|
| van Lint J.H., Wilson R.M. — Course in Combinatorics |
|
|
|
| Предметный указатель |
Simple closed path 5
Simple design 187ff 195
Simple difference set 331 347—348
Simple digraph 2
Simple graph 2
Simple path 5 21
Simplex code 217
Sims, C.C. 237 247 248
Singer difference sets 336—40
Singer, J. 337 340
Singer’s theorem 336 340
Singleton bound 217
Singleton, R.R. 33 494
Sink in a transportation network 49
Six color theorem 428
Skolem sequences 211
Skolem, Th. 211 213
Sloane, N.J.A. 228 229 493
Slope of a Ferrers diagram 137
Smetaniuk, B. 164 171
Smith normal form 358
Source in a transportation network 49
Spanning arborescence 14ff
Spanning subgraph 4 403
Spanning subset in combinatorial geometries 276
Spanning tree 11ff 66 449ff 481 501
Special network 457
Special path 51ff
Spencer, J.L. 26 27 47 297 482
Sperner, E. 43 47 48 292
Sperner’s Theorem 43 45 48 292 484
Sphere packing bound 215 378 384 398
Spherical 2-distance set 239
SPREAD 287 296
Sprott, D.A. 335 341
Square design 196
Squared rectangle 455ff
Squared square 456 460
Standard tableaux 142
Stanley, R.P. 129 130 312 405 426
Stanton — Sprott difference sets 335
Stanton, R.G. 335 341
Steiner system 188ff 193 195 269 313ff 323 326—327
Steiner triple system 205—213
Steiner, J. 188 210 213
Steinitz, E. 423 425 426
Stirling numbers 104—108 473
Stirling, J. 88 89 108
Stirling’s formula 88 89 162 181
Strauss, E.G. 267 268
Strength of a flow 50
Strength of an orthogonal array 382
Strong product of graphs 394
Strongly connected digraph 399
Strongly regular graph 231ff 364 401
Sub-Latin square 160
Subdivision of a graph 403ff
Subgeometry 270
Subgraph 4
Subplane of a projective plane 315ff
Subsquare of a Latin square 160
Subsquares of orthogonal Latin Squares 265
Substitution of power series 507
Substitution Principle 95 98
Substructure of an incidence structure 315
Support of a codeword 219 414
Supporting hyperplane 424
surface 408
Surjections, number of 71 106 302
Sylvester, J.J. 77 146 390
Sylvester’s law 64 390
Symbol 157
Symmetric chain 44 46 47
Symmetric designs 196 278 355ff 499
Symmetric functions 474
Symmetry code 222
System of distinct representatives (SDR) 35ff 77 81 87—89 161 166
System of walks in a graph 419ff
Szegoe, G. 474
Szekeres, G. 26 28
t-designs 188ff 195 219—223 225 296 364 381 382
Tail of a directed edge 2 405
Tait coloring of a graph 430—433
Tait, P.G. 430 432 448
Tarry, G. 251
Tarsky, M. 28
Teirlinck, L. 195 213
Tennis matches 495
Ternary code 214
Ternary Golay code 226
| Thas, J.A. 247 249
Thomas, S. 297
Thompson, J.G. 228 229
Thompson, T.M. 228 230
Thrall, R.M. 145 146
Tight design 195 384 387 484
Tits, J. 192 213
Todd, J.A. 334
Torus 434
Total order 42
Totally isotropic 356
Totally unimodular matrices 452
Tournament 27 390
Transitive tournament 27
Translation plane 286 297
Transportation network 49ff 149 477
Transversal design 243 257 495
TREE 6 11—18 62—65 404
Triangles in a graph 22 29—31 483
Triangular embedding of a graph 441 447
Triangular graph 232
Triangular mesh 436
Trivalent graph 431—432 483 500 503
Turan, P. 29 30 33 34
Turan’s Theorem 30ff
Tutte connectivity 406
Tutte, W.T. 406 414 426 433 448 457 460
Tverberg, H. 42 48
Type of a partition of a set 311 465
Type of a permutation 330 464—467
Unital 327
Unordered partition 132
Valency or valence of a vertex 4
Valiant, W.G. 88 90
Van der Waerden conjecture 85 91—99 161 171
Van der Waerden, B.L. 26 28 85 89 91 99 171
van Ebbenhorst Tengbergen, C. 44 48
van Lint, J.H. 40 41 48 60 61 89 90 91 99 146 228 229 246 247 248 249 378 389 482 483 487 488 492 494
van Rees, G.M.J. 261 268
Vandermonde determinant 143
Vandermonde matrix 221
Vandermonde, A.-T. 142
Vanstone, S.A. 156 199 248 261 268 389 492
Varieties 211
Vaughan, H.E. 40
Veblen, O. 279 290
Vedder, K. 362
Vertex condition 438
Vertex connectivity 406
Vertex of a convex polytope 424
Vertices of a graph 1
von Segner, J.A. 116
von Staudt, K.G.C. 211
Voorhoeve, M. 86 89 90
Walk in a graph 4
Walks in the X, Y plane 103 110 118 487
Wallis, J.S. 186
Watkins, J.J. 10
Watson, G.N. 131
Wedderburn, J.H.M. 285
Weight enumerator of a code 218
Weight of a codeword 214
Weighted graph 16
Weisner, L. 300 304 312
Weisner’s theorem 300 304 310
Welch, L.R. 340
Welsh, D.J.A. 425 426
White, A.T. 448
Whitney dual of a graph 416ff 441
Whitney, H. 406 425 426
Whittaker, E.T. 131
Wilbrink, H.A. 355 363
Wilf, H. 401
Williamson, J. 177 186
Williamson’s method 177 179
Wilson — Petrenjuk inequality 194
Wilson, R.J. 10 248 427 447
Wilson, R.M. 194 212 267 268 306 312 371 384 389
Winkler, P. 65 69
Witt design 195 222 225 236—237
Witt, E. 195 213 356
Woolhouse, W.S.B. 210 213
Wright, E.M. 140 146 147
Write-once memory 209 212
Young diagram 135
Young tableau 142—146
Young, A. 142 147
Young, J.W. 279 290
Youngs, J.W.T. 435 444 448
Zeta function of a poset 298
Zeta function, Riemann 74 78
|
|
|
| Реклама |
|
|
|
|
|
О проекте