Авторизация
Поиск по указателям
Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1)
Обсудите книгу на научном форуме Нашли опечатку?
Название: Handbook of combinatorics (vol. 1)Авторы: Graham R.L., Grotschel M., Lovasz L.Аннотация: Combinatorics research, the branch of mathematics that deals with the study of discrete, usually finite, structures, covers a wide range of problems not only in mathematics but also in the biological sciences, engineering, and computer science. The Handbook of Combinatorics brings together almost every aspect of this enormous field and is destined to become a classic. Ronald L. Graham, Martin Grotschel, and Laszlo Lovasz, three of the world's leading combinatorialists, have compiled a selection of articles that cover combinatorics in graph theory, theoretical computer science, optimization, and convexity theory, plus applications in operations research, electrical engineering, statistical mechanics, chemistry, molecular biology, pure mathematics, and computer science.
Язык: Рубрика: Математика /Алгебра /Комбинаторика /Статус предметного указателя: Готов указатель с номерами страниц ed2k: ed2k stats Год издания: 1995Количество страниц: 1120Добавлена в каталог: 10.03.2005Операции: Положить на полку |
Скопировать ссылку для форума | Скопировать ID
Предметный указатель
Directed girth 16 Directed graph 15 Directed path 16 403 Directed poset 1854 Directed reachability problem 1608 1642 Directed trail 16 Directed walk 16 Directed-cut covering 1676 Directed-graph reachability problem 1638 1639 Directed-path system 30 Dirichlet s box principle 2184 Dirichlet series 929 1099 Dirichlet theorem 933 Dirichlet, R.G.L. 2184 Dirworth theorem 44 437 438 2186 Disconnected matroid 491 Discrepancy 1792 1802 2044 Discrepancy diagonal 1414 Discrepancy hereditary 1414 Discrepancy inhomogeneous 1414 Discrepancy of hypergraphs 1408 1414 Discrepancy of matrices 1416 Discrepancy of point sequences 1428 Discrete group 921 Discrete isoperimetric problem 1297 Discrete logarithm 1520 Discrete logarithm problem 1619 Discrete subgroups 942 958 Disjoint paths 143 159 536 Disjointness problem 2007 Disjunctive compound 2124 Disk order 467 Dismantlable poset 1854 Distance 10 114 776 Distance criterion 161 Distance distribution 779 Distance enumerator 779 Distance invariant 779 800 Distance-regular graph 760 1506 1507 Distance-transitive graph 629 766 1452 1455 1505 1506 Distinct representatives 2185 Distributive lattice 497 Distributive supermatroid 5S3 Divide and conquer 1515 Divisor graph 1012 Dixon, J.D. 1486 Dixon’s binomial-sum identity 1075 dn (hereditary closure) 581 DNA 1985 dodecahedron 6 1458 1507 Dodunekov, S.M. 727 Doetsch, G. 1192 1212 Dominant singularities 1096 1151 Dominant zero 1108 Dominate 15 2131 Dominating circuit 42 Domineering 2127 2158 Donald, A. 87 Doob, M. 1460 1461 1726 1727 1733 1973 1974; D.M.” Double bond 1960 Double coset 1966 Double cover conjecture 296 326 Double jump 359 Double set coverings 1115 Doubly periodic graph 311 Doubly resolvable design 712 Doubly stochastic 187 Doubly stochastic matrix 187 1667 Doubly transitive group 2053 Doubly transitive permutation group 2057 Douthett, J. 75; see “Barefoot C.A.” Dow, S. 713 Dowker, C.H. 1851 Dowling geometry 517 Dowling, T.A. 511 517 831 832 1713 Down-shift 1299 Downstar 2126 Doyen, J. 702 704 709 710 Doyle, P.G. 1484 1740 1744 Drawing 1915 Dress, A. 507 579 888 Dress, F. 982; see “Baiasubramian R.” Driessen, L.H.M.E. 703 704 Drinfeld, V.G. 667 Driscoll, J.R. 1486 Drmota, M. 1191 Dtsargues theorem 652 2181 Du Shiran 2166; see “Li Yah” Dual (polar) graph 768 Dual (polar) polytope 879 Dual (polar) space 685 Dual body 926 Dual code 777 Dual complex 904 Dual design 695 Dual discreteness 207 Dual distance 798 Dual feasible 605 Dual graph 259 308 Dual greedy algorithm 556 Dual heuristic 1543 1550 1560 1586 Dual hypergraph 386 391—393 397 405 Dual lattice 925 926 Dual linear program 405 Dual matroid 492—494 505 519 Dual problem 1657 Dual Ramsey theorem 1370 Dual solution 204 Dual transportation polyhedron 1669 Duality 396 492 493 498 663 2188 Duality of linear programming 1657 2186 Duality principle 493 Duality theorem 604 1587 1588 1592 Dualizability 885 Dually connected 1856 Dudeney, H.E. 2137 Duehat, P.B. 393; see “Barge C.” Duehet, P. 313 393 398 400 Duehet, P.A. 400; see “Arami Z.” Duernberger, E. 1473 Duffain, R.J. 538 Duffus, D. 438 462 1346 Duffus, D.A. 1270 Duffus, D.B. 469; see “Babai L.” Dugundji, I. 1862 Duivastijn, A.J.W 891 Duke, R. 321 Duke, R.A. 1351 1557; N.” Dunbar, J. 685 Dunstan, F.D.J. 520 580 581 Dunwoody, M.J. 1481 Dunwoody, M.J.A. 1494 1495: W” Dupain, Y. 1441 Duplicate Kayles 2137 Durfee square 2174 Durfee, W.P. 2174 Dushnik, B. 455 459 Duske, J. 805 Dutka, J 2171 Dvoretzky, A. 2042 Dyer, M. 957 1442 1558 1741 Dyer, M.E. 881 Dynamic programming 1562 1989 E lliptic curves 958 Ear 195 Ear decomposition 118 195 218 Eberlein polynomial 764 Eckhoff, J. 1829 EckhoffA conditions 854 Edelman, P.H. 522 1850 2072 Edelsbnunner, H. 811 827 837 865 Edelsbrunner, H.A. 865; see “Aronov B.” Edelsbrunner, H.B. 823 825 1299; K.” Edelsbrunner’s problem 865 Edelstein, M. 813 EDGE 5 383 386 391 877 878 1295 1843 Edge coloring 260 271 272 295 388 394 395 397 417 425 426 513 1632 1690 2179 Edge connectivity 34 370 Edge cover 181 215 388 394 Edge covering 81 Edge cut 34 Edge of a hypergraph 385 Edge of attachment 40 Edge packing 81 Edge pancyclic digraph 78 Edge partition 81 Edge space 8 Edge-1-cyclic digraph 78 Edge-chromatic number 51 271 Edge-cover polytope 1667 Edge-covering number 388 410 Edge-critical graph 272 Edge-disjoint 34 Edge-disjoint Hamilton cycles 1260 Edge-disjoint paths 160 Edge-following algorithm 908 Edge-graph 879 905 906 Edge-transitive 1452 1454 1469 1481 1504 Edge-weighted graph 14 Edmonds matroid intersection theorem 1678 Edmonds — Gallai partition 199 Edmonds — Gallai theorem 199 Edmonds, J. 84 127 134 142 190 205 206 210 212—214 216 217 225 263 403 406 503 520 555 558 561 563 564 566 568—570 572—574 1580 1582 1609 1610 1661 1672—1675 1677 1678 1680 1685 1837 1838 1950 Edmonds, J.A. 206 213 214 1685; J.” Edmonds, J.B. 546; see “Cunningham W Edmonds, J.C. 1685; see “Gnffln V.” Edmonds, J.D. 209 210; W.R.” Edmonds, J.R. 84 182 185 187 190 199 207 208 320 500 561 1588 1732 1897 1919 1920 2178 2188 Edmond’s matching polyhedron theorem 1680 Educational Times 812 823 Edwards, A.W.F. 2166 Egawa — Miyamoto theorem 1262 Egawa, Y. 26 28 36 82 155 1262 Egervary, E. 190 Egervary, J. 1668 Eggleston, H.G. 849 946 Eggleton, R.B. 315 Egglike inversive plane 659 Egorychev, G.P. 947 1208 1213 Egyptian fractions 1013 Ehrenfeucht, A. 1299; see “Blumer A.” Ehrhart, E. 948 949 951 952 Ehrlich, S. 1970; see “Wang T.” Eigenvalues 1464 1495 1496 1511 1733 1740 1755 1757 1758 1972 1973 Eigenvalues gap 1482 Eigenvalues multiplicity 1459 1507 Eigenvectors 1972 Eilenberg, S. 1459 Eisenbud, D. 2059 Eisenbud, D.A. 2059 2060; C.” El-Zahar, M.H. 85 Elation 668 Eldridge, S.E. 1278 Eldridge, S.E.A. 1277 1278 1284; B.” Electric network 1744 1913 Electronic charge density 1972 Elekes, G. 847 1442 Element distinctness 1762 1763 Elementary collapse 1853 Elementary exchange 69 Elementary homotopies 1821 1832 1839 Elementary plane 814 Elementary quotient 510 Elementary vector 603 Elias, P. 126 2186 Ellingham, M.N. 62 1449 Elliott, P.D.T.A. 832 846 Ellipsoid 955 Ellipsoid method 1571 1591 1661 Elliptic quadric 659 665 Elspas, B. 1497 Elusive property 1285 Embedding 92 391 436 Embedding automorphic 1491 1493 1494 Embedding isometric 1465 Embedding of graph 303 Empty graph 6 Empty polygon 862 Empty triangle 862 Encheva, S.B. 727; see “Dodunekov S.M.” Encryption function 2029 Encryption key 2029 End of a graph 1480 1494 1505 End of a group 1480 End of a locally compact space 1480 End of a walk 9 End of an edge 5 Endblock 11 Endgame 2122 Ending condition 2121 2136 2142 2145 Endomorphism 1451 1461 Endomorphism monoid 1499 energy levels 1972 Engel, K. 1296 Engeler, E. 640 Enlargement lemma 818 Enlsinger, R.C.A. 1275; see “Clark L.H.” Enomoto, H. 52 697 Enomoto, H.A. 153; see “Ando K.” Entire function 1149 Entringer, R.C. 77 80 Entringer, R.C.A. 75 78; C.A.” Entringer, R.C.B. 52 1275; L.H.” entropy 1801 Entropy function 1077 Enumeration 878 891 Enumeration of spectroscopic signals 1965 EPG 685 Epstein zeta function 928 Epstein, R.A. 2146 Equality problem 2007 Equidistant code 785 Equipotent 2109 Equitable 1727 Equitable partition 1709 Equivalence classes 1964 1968 Equivalent codes 777 Equivalent mapping 1864 Eratosthenes’s sieve 972 Erd5s — Rado theorem 2096 Erdelyi, A. 1094 1095 1212 Erdos 1791 1810 Erdos cardinals 1336 2102 Erdos theorem 240 1236 Erdos — de Bruijn theorem 829 Erdos — Fuchs theorem 990 Erdos — Ko — Rado theorem 1296 1297 1456 2187 Erdos — Moser conjecture 1840 Erdos — Rado partition arrow 1334 Erdos — Renyi theorem 1241 1242 Erdos — Simonovits theorem 1247 Erdos — Sos conjecture 1281 Erdos — Stonc theorem 239 1243 Erdos — Voon bound 1808 Erdos, P. 26 39 48 74 76 77 81 85 87 238—241 250 256 264 277 314 336 354 355 357 358 361 365 370 373 377 406 419 422 424 425 456 458 459 764 811 815 818 824 825 834—838 840 842—846 862 865 923 970 980 987 990 991 997—999 1006 1012 1013 1112 1145 1146 1164 1210 1213 1236 1238 1241—1244 1247—1249 1251—1253 1263—1266 1268 1274 1296 1298 1300 1310 1313 1317 1319 1320 1323 1334 1336 1339 1340 1345—1348 1350 1351 1355 1357 1367 1371 1373 1375 1383 1385 1387—1389 1435 1461 1463 1482 1486 1508 1759 1769 1787—1789 1793 1796 1798 1801 1810 2092 2093 2095 2097 2099 2102 2104—2106 2179 2184 2185 2187 Erdos, P.A. 412 414; R.” Erdos, P.B. 847; see “Aiming N.H.” Erdos, P.C. 837; see “Avis D.” Erdos, P.D. 1482 1485; L.” Erdos, P.E. 1244 1317; B.”
Реклама
|
|
О проекте