Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) :: Электронная библиотека попечительского совета мехмата МГУ

Главная Ex Libris Книги Журналы Статьи Серии Каталог Wanted Загрузка ХудЛит Справка Поиск по индексам Поиск Форум

Авторизация

Поиск по указателям

Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1)

Обсудите книгу на научном форуме

Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter

Название: 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.
The 20 articles in Volume 1 deal with structures while the 24 articles in Volume 2 focus on aspects, tools, applications, and horizons.

Язык:

Рубрика: Математика/Алгебра/Комбинаторика/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 1995

Количество страниц: 1120

Добавлена в каталог: 10.03.2005

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

Impartial games      2127 2132 2134 2135 2138 2141 2145 2150 2151
Implicit functions      1161 1195
Imprimitive action      617
Imrich, W.      1265 1465 1466 1494 1495 1753
Imrich, W.A.      1465; see “Aurenhammer F.”
Imrich, W.B.      1474 1522; C.D.”
In, M.A.      1919; see “Murota K.”
Inaccessible cardinal      2112
Incentive      2128
Incidence algebra      1052
Incidence graph      18 386 421 674
Incidence matrix      6 386 695 1707 1739 2170 2183
Incidence poset      469
Incidence relation      5
Incidence vector      1567 1653
incident      18 55
Inclusion and exclusion      2167 2171
Inclusion-exclusion formula      29
Inclusion-Exclusion Principle      971 1044 1049 1051 1053 1087
Indecomposable permutations      1030 1116
Indefinite hypergeometric summation      1075
Indegree      15
Independence number      40 372 1258 1464 1471 1772 1773
Independence polytope      1678
Independence structure      2178
Independence system      555 582 1546
Independent set      40 483 485 488 489 491 492 494 500—503 512 956 1471 1757
Index of a design      696
Index of a sublattice      924
Induced character      632 633
Induced forbidden subgraph      1254
Induced hypergraph      386
Induced matroid      500
Induced subcomplex      1857
Induced subgraph      8
Infinite families      851
Infinite graph      5 2179
Infinite locally finite      1470 1475 1480 1484 1505
Infinite Ramsey theorem      1351 1352
Infinitesimal rigidity      1915
Information rate      775
Information symbols      777
Ingham, A.E.      1124 1125 1129 1130
Ingham’s Tauberian theorem      1129
Inglelon, A.W.      507 508 530
Ingleton, A.W.      520; see “Dunstan F.D.J.”
Inner distribution      759
Input gate      2012
INSERT operation      2019—2021 2023
Instance      14 1601
Integer decomposition property      1664
Integer distances      847
Integer hull      1691
Integer lattice      924 925 945
Integer matrix      952
Integer polytope      949
Integer program feasibility problem      956
Integer programming      921 952 956
Integer programming problem      1618
Integral geometry      958
Integral lattice      924
Integral polyhedron      1656
Integral polymatroid      566
Integral quadratic forms      922
Integral solution      397
Integral vector      1652
Interaction graph      1949
Interactive proof      1511 1631
Interactive proof system      1630 1631
Interactive protocol      1630
Interior point method      1592
Interlacing      1734
Internal vertices      9 40
Internally disjoint      34
Intersecting cuts      1566
Intersecting families      1301 2187
Intersecting hypergraph      387 391 394 411 412 425 1295
Intersecting submodular function      572
Intersection      7
Intersection graph      387
Intersection matrices      399 755
Intersection numbers      754
Intersection-closed family      1296
Intertwining conjecture      344
Interval graph      266 1994
Interval greedoid      1830
Interval hypergraph      395 398 400
Interval in a lattice      393
Interval order      459
Interval scheduling      1901
Intractable      598
Intractable mairoid problem      557
Intramolecular rotations      1966
Intrinsic r-volume      946
Invariant      1512 2177
Invariant complete      1456
Invariant integration      2051
Invariant theory      2175
inversion      1027 1105
Inversion law      950
Inversion table      1027
Inversive plane      659 704
Invertibility      885
Involution      519 671 884
Iri, M.      160 595 1913 1921 2050
Iri, M.B.      1919; see “Recski A.”
Irreducible      502 815 1854
Irreducible character      630
Irreducible cyclic code      785
Irreducible representation      630
Irredundant base      637
Irredundant system      1656
Irregular node      227
Irving, R.      1373
Isaacs, R.      275 1275
Isaacson, J.D.      245; see “Matula D.W.”
Isbell, J.      628
Iscmorphic      5 486 877 878 907 2109
Ishizaki, Y.      1921; see “Ohtsuki T.”
Ising model      1210 1928 1944 1950 1951
Ising model partition function      1977
Ising problem      1943
Isolated      934
Isolated singularities      1148
Isolated vertex      7
Isolation of zeros      1158
Isomer enumeration      1960
Isomeric structures      1960
Isomeric synthons      1969
Isomerization reactions      1966 1967
Isomers      1970
Isometry      884
Isomorpfatc hypergraphs      386
Isomorphism      5 392 1450 1510 1514 1515
Isomorphism classes of graphs      1060
Isono, K.      1994
Isoperimetric      1297
Isoperimetric ratio      1481
Isoperimetry      1481
Isospectral      1497
Isotopy theorem      885
Isthmus      292
Itai, A.      165
Itai, A.A.      143; see “Zenavi A.”
Ito, N.      697
Ito, N.A.      697; see “Enomoto H.”
Ito, T.      750 761 762 1496 1505; E.”
Ivanov, A.      683 768 1506
Ivanov, A.A.      1506; see “Faradzev I.A.”
Ivanov, A.V.      1506; see “Faradzev I.A.”

Ivanov, A.W.      1506; see “Ivanov A.A.”
Ivchenko, G.I.      370
Iwanicc, H.      982
J ones polynomial      2041 2074—2077
Jackson theorem      61 1259 1261
Jackson, B.      27 42 43 45—47 53 54 59—63 66—68 83 90 154 155 1259 1261 1474
Jackson, B.A.      85 94; J.-C.”
Jackson, B.B.      61; see “Broersma H.J.”
Jackson, B.C.      52; see “Enomoto H.”
Jackson, B.D.      73 74 155; H.”
Jackson, B.E      49.; see “Hahn G.”
Jackson, D.M.      1023 1088 1098 1107 1213; I.P.”
Jacobi polynomials      1988
Jacobi symbol      2031 2032
Jacobi, C.G.J.      1729
Jacobian varieties      958
Jaeger, F.      65 85 89 92—94 292 297 416 513 516
Jaeger, F.A.      85 94; J.-C.
Jaikumar, R.; see Fisher, MX.      1884 1885
Jakobsen conjecture      275
Jakobsen, IT.      258 275 333
Jambu, M.      2068 2072
Jamefelt, G.      658
James, G.D.      633 1725
Jamison, R.      406 466 826
Jamison, R.A.      522; see “Edelman P.H.”
Jamison, R.E.      662 1771
Jamshy, U.      92
Janko, Z.      731
Janot, C      958
Janson, S.      361 363 367 369
Janson, S.A.      1090 1210; A.D.”
Jech, T.      2087
Jenkyns, T.      582 1547
Jensen, H.F.      314
Jensen, R.      578; see “Korte B.
Jensen, T.R.      236 238
Jensen’s Inequality      1814
Jermm, M.      1486 1741 1742
Jeroslow, R.      1692
Jeroslow, R.G.      1692
Jeroslow, R.G.A.      1692;see “Blair C.E.”
Jerram, M.R.      637 1517 1558 1559 1951
Jerram, M.R.A.      1558; see “Sinclair A.J.”
Jerrum’s filter      637
Jewett, R.I.      1338; see “Hales A.W.”
Jezek, J.      1368
Jichang, S.      446
Jimbo, Sh.      1755 1756
Job shop scheduling      1904
Jockush, C.G.      1357
Johnson bound      782
Johnson scheme      763
Johnson, D.S.      244 245 423 1548 1551 1556 1557 1559 1630 1632 1635 1636 1888 1950
Johnson, D.S.A.; see Coflman Jr, E.G.      1552
Johnson, D.S.B.; see Garey, M.R.      14 246 247 315 326 910 953 956 1511 1551 1601 1632 1634 1998 1999
Johnson, E.L.      1696; see “Crowder H.”
Johnson, E.X.      1685 1696
Johnson, E.X.A.      1696; see Hammer P.X.
Johnson, E.X.B.      84 212—214 216 217 403 1950; J.
Johnson, M.A.      1958 1977
Johnson, P.      1970; see “Wang T.”
Johnson, P.D.      272; see “Hilton A.J.W.”
Johnson, S.M.      714 783 1473
Johnson, S.M.A.      1696 2188; G.B.”
Johnson, V.B.      2045
Join-contractible      1852
Joined vertices of a graph      5
Joins      1843 1845 2149 2150
Jolley, L.B.W.      1075
Jones, C.M.      1894; see “Arnold L.R.”
Jones, G.A.      1487
Jones, R.      1990; see “Waterman M.S.”
Jones, V.F.R.      2074
Jones, W.B.      1140
Joni, S.A.      1107; see “Garsia A.M.”
Jonsson, B.      1464 1466
Jordan curve theorem      306
Jordan group      625 626 640
Jordan measurable      932
Jordan, C      617 626 1457 1479 2053
Joyal, A.      1024
Juenger, M.      1568 1572 1573 1950 1951; F.”
Juenger, M.A.      1572 1573 1696 1950 1951; M.”
Juhasz, R.      861
Jump      418
Jump value for r-graphs      1248
Jumping arc      575
Jung, H.A.      62 158 166 536 1259
Jung, H.A.A.      265; see “Brown W.G.”
Jungen, R.      1170
Junger, M.      1573 1696 1890
Jungerman, M      1493
Jungnickel, D.      662 699 705 2184
Jungnickel, D.A.      699; see “Beth Th.”
Jurgensen, H.      805; see “Duske J.”
Just, B.      958; see “Hastad J.”
k-acyclic      1847
k-arc-connected      147
k-blocking      404
k-blocking number      396
k-book      303
k-canonical representation      895
k-chromatic      388 406 1724
k-chromatic graph      48
k-chromatic hypergraph      417
k-cliques      1457
k-colorable      388
k-colorable graph      48 246
k-colorable hypergraph      246 415 417 422
k-coloring      48 388
k-complete filter      2114
k-connected      34 147 584 1846
k-connected greedoid      1831
k-critical      417 421 425
k-dominating circuit      42
k-edge colorable      51
k-edge coloring      51
k-edge connected      34 147 150
k-extendable graph      195
k-face colorable      56
k-face coloring      56
k-flow      277
k-flow problems      277
k-graph      1295
k-Helly property      393
k-linkage      35
k-matching      404
k-matching number      396
k-optimal      49 50
k-partite family      1299
k-partite k-graphs      1323
k-path problem      341
k-section (of a hypergraph)      386
k-skeleton      1843
k-strong      34
k-tree      27
k-truncation      494
k-uniform family      1295
k-walk      27
Kabadi, S.N.      580 581
Kabadi, S.N.A.      579; see “Chandrasekaran R.”
Kabatyanskii, G.A.      937
Kahn — Saks — Sturtevant conjecture      1286
Kahn — Saks — Sturtevant theorem      1285
Kahn, J.      448 453—455 476 507 516 531 659 661 1285 1286 1313 1719 1823 1853
Kahn, J.A.      1507; see “Bannai E.”
Kahn, J.B.      1314; see “Boros E.”
Kahn, J.C.      412 456 457; Z.”
Kahn, J.D.      1744

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

О проекте