Ãëàâíàÿ    Ex Libris    Êíèãè    Æóðíàëû    Ñòàòüè    Ñåðèè    Êàòàëîã    Wanted    Çàãðóçêà    ÕóäËèò    Ñïðàâêà    Ïîèñê ïî èíäåêñàì    Ïîèñê    Ôîðóì   
blank
Àâòîðèçàöèÿ

       
blank
Ïîèñê ïî óêàçàòåëÿì

blank
blank
blank
Êðàñîòà
blank
Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1)
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.


ßçûê: en

Ðóáðèêà: Ìàòåìàòèêà/Àëãåáðà/Êîìáèíàòîðèêà/

Ñòàòóñ ïðåäìåòíîãî óêàçàòåëÿ: Ãîòîâ óêàçàòåëü ñ íîìåðàìè ñòðàíèö

ed2k: ed2k stats

Ãîä èçäàíèÿ: 1995

Êîëè÷åñòâî ñòðàíèö: 1120

Äîáàâëåíà â êàòàëîã: 10.03.2005

Îïåðàöèè: Ïîëîæèòü íà ïîëêó | Ñêîïèðîâàòü ññûëêó äëÿ ôîðóìà | Ñêîïèðîâàòü ID
blank
Ïðåäìåòíûé óêàçàòåëü
Group compact topological      2051
Group Coxcter      677 2061
Group crystallographic      1488
Group cyclic      1451
Group dihedral      1451
Group discrete      921
Group doubly transitive      1451 1504 1507 2053
Group doubly transitive permutation      2057
Group end of      1480
Group exceptional      620
Group free      1479 1494 1495
Group fundamental      1495 1846 2069
Group Galois      954
Group general linear      655
Group genus of      1493
Group graph of      1495
Group homology      1846
Group isometry      1458
Group Jordan      625 626 640
Group Lie      922 1479
Group Mathieu      622 625 716 2183
Group monster      922
Group multiple transitive      623 625
Group nilpotenl-by-fimte      1478
Group nilpotent      1478
Group of Lie type      619 621
Group of permutations      2169
Group orthogonal      620 1460
Group permutation      614 1516 1963 2053 2054
Group polyhedral      1459
Group primitive      616 1502 1515 2054
Group primitive permutation      2053 2056
Group projective special linear      620
Group rank of permutation      626
Group reduced simplicial homology      1846
Group reduction functions      2172
Group reflection      1473
Group regular      615
Group representation theory      2174
Group representations      1755 1756
Group representations of symmetric      1057
Group rotation      1458
Group semiaflme      1453 1454
Group simple      2056 2057
Group solvable      1453
Group space      922 941 943
Group sporadic      622
Group symmetric      1451 1473 2053
Group symmetry point      1965
Group symplectic      620
Group transitive      614 1482
Group twisted      620
Group uniprimitive      2054
Group uniprimitive permutation      2053
Group unitary      620
Group vertex-stabilizer      1452
Group-divisible design      705
Grove, L.C.      1734
Growth exponential      1478
Growth polynomial      1478
Growth rate      1477
GRR (graphical regular representation)      1476 1477 1500
Gruber, P.      923; see “Erdos P.”
Gruber, P.M.      811 923 929 930 933 934
Grundy number      276
Grundy, P.M.      2133 2136 2137 2150
Grundy’s Game      2136 2150 2158
Guan Meigu (Kwan Mei-Ku)      1888 2187
Guess tape      1606
Guibas, L.      865; see “Aronov B.”
Guibas, L.A.      823 825 1299; K.”
Guibas, L.B.      827; see “Edelsbrunner H.”
Guibas, L.J.      1103 1134 1194
Guigas, B.      311; see “Mani-Levitska P.”
Guinness, S.Mc.      1484; see “Markvorsen S.”
Gupta, R.P.      273 1668
Gupta, U.I.      1903
Gustavsson, T.      88
Gustin, W.      325
Gutin, G.      69
Gutjahr, W.J.      1191
Gutman, I.      1974
Gutman, I.A.      1973 1974; D.M.”
Gutman, I.B.      1731; see “Godsil C.D.”
Gutman, I.C.      1973; see “Graovac A.”
Guy, M.J.T.      845; see “Conway J.H.”
Guy, R.      838; see “Erdos P.”
Guy, R.K.      305 314 315 970 1006 1011 1013 2119 2135 2147
Guy, R.K.A.      2119; see “Berlekamp E.R.”
Guy, R.K.B.      314; see “Erdos P.”
Gy6ri, E.      400
Gyarfas conjecture      1280
Gyarfas — Komlos — Szemeredi theorem      1266
Gyarfas, A.      77 236 415 417 1266 1267 1280 1313
Gyarfas-Promel-Szemeredi-Voigt theorem      1267
Gydri, E.      865; see “Alon N.”
Gyori, E.      1238
Gyory, E.      158 1830
Gyory, K.      991
H ypercycle      387 395 420
H-admissible      1178
H-admissible function      1179
h-vector      898—900 1841
Haar measure      2041 2051
Hadamard code      795 803
Hadamard matrix      729 2183
Hadamard product      1110
Hadlock, F.O.      218
Hadwiger number      1493 1494
Hadwiger theorem      857
Hadwiger, H.      238 811 842 848 855—857 859 950 951 2179
Hadwiger, H.A.      950; see “Bokowski J.”
Hadwiger, H.B.; see “Debrunner, H.”      855 856
Hadwiger-Nelson problem      238 841
Hadwigert conjecture      238 257 258 262 332 2179
Haemers, W.H.      675 699 701 704 731 750 761 764 765 1734 1737
Haemers, W.H.A.      700 731; H.J.”
Hagauer, J.      1465; see “Aurenhammer F.”
Hagerup, T.      128; see “Cheriyan J.”
Haggard, G.      92
Haggkvist, R.      37 46 53 61 63 67 69 73 76 77 82 87 158 426 1259—1261 1263
Haggkvist, R.A.      1262; see “Bollobas B.”
Haggkvist, R.B.      89; see “Bondy J.A.”
Haggkvist, R.C.      64; see “Caccetta L.”
Haggkvist, R.D.      713; see “Daykin D.E.”
Haggkvist, R.E.      91; see “Grossman J.W.”
Hahn. G.      49
Hahn. S.      1208; see “Flatto. L.”
Hajek, B.      1559; see “Sasaki G.H.”
Hajnal — Szegedy theorem      1282
Hajnal — Szemeredi theorem      248 1280
Hajnal, A.      248 263 264 266 416 1280 1464 1713 2005 2011 2105 2106
Hajnal, A.A.      82 1280; K.”
Hajnal, A.B.      48 77 240 241 250 256 264 424 1268 1274 1336 1346 1351 1357 1375 1383 1385 1389 2092 2093 2097 2102 2104 2106; P.”
Hajnal, A.C.      2113; see “Galvin F.”
Hajnal, P      1282
Hajnal, P.A.      459 465; Z.
Hajos constructible graph      252
Hajos construction      252
Hajos theorem      252
Hajos, G.      252 934
Haken, A.      1555
Haken, W; see Appel, K.      56 236—238 2179
Hakimi, S.L.      79
Hakimi, S.L.A.      53; see Bauer D.
Halasz, G.      1430 1438—1441
Halberstam, F.Y.      86; see “Bondy J.A.”
Halberstam, H.      970 979 981 986 987 990 992
Halberstam, H.A.      986; see “Freiman G.A.”
Hales — Jewett theorem      1005 1338 1363
Hales — Jewett theorem density      1366
Hales, A.W.      863 1338
Hales, T.      936
Hall Jr, M.      654 699 702 704 730 731 804
Hall Jr, M.A.      715 804; W.G.”
Hall theorem      1052 1053 2185
Hall triple system      654
Hall, D.W.      538
Hall, J.I.      654
Hall, L.H.      1975—1977; see “Kier L.B.”
Hall, M.      2183 2185
Hall, P.      185 617 2185
Hall, R.-R.      992
Hall’s condition      185
Hall’s marriage theorem      438
Halm, R.      153 156 258 1480
Halmos, P.      2051
Halmos, P.R.      2185
Halstenberg, B.      2010
Halting problem      1605
Halving lines      865
Ham sandwich theorem      1828 1865
Hamada conjecture      674
Hamada, N.      674 716
Hamada, N.A.      763; see “Yamamoto S.”
Hamermesh, M.      1460
Hamidoune, Y.      313; see “Duchet P.”
Hamidoune, Y.O.      157 563 1469 1470
Hamilton cycle      462 1256 1275 1472 1473 1738
Hamilton decomposition      86
Hamilton l-foctorable      80
Hamilton path      20 1472
Hamilton-connected      26
Hamiltonian      1927 1928 1948
Hamiltonian circuit      20 1548 1601 1602 1607 1610 1614 1617 1634 1635 2028 2034 2035
Hamiltonian graph      20 2176
Hamiltonian path      1790
Hamiltonicity      365
Hamiltonicity obstacles      1472
Hammer, J.      923
Hammer, J.A.      923; see “Erdos P.”
Hammer, P.L.      1696
Hammer, P.L.A.      267; see “Foldes S.”
Hammersley, J.M.      1934 1937 1940
Hammersley, J.M.A.      1932; see “Broadbent S.R.”
Hamming bound      781
Hamming code      667 777 778 783 788 792 2047
Hamming cone      2048
Hamming cube      1802 1806
Hamming distance      1802
Hamming graph      1463
Hamming metric      2048 2049
Hamming scheme      762
Hamming, R.W.      805
Hammond operator      2174
Hammond, J.      2174
Hammons Jr, A.R.      797
Hammons Jr, A.R.A.      797; see “Calderbank A.R.”
Hanani, H.      697 703—705 707—711 714 715
Hanani, H.A.      714; see “Brouwcr A.E.”
Hanani, H.B.      1796; “see Erdos P.”
Handelman, D.E.      958
Handelsman, R.A.      1094 1212; N.”
Hanf, W.P.      2100
Hanlon, P.J.      1187 1188 1989; J.R.”
Hanner, O.      2129
Hansen, E.R.      1075
Hansen, J.      1167
Hansen, R      423
Hansen, S.      814 815
Hanson, D.      252
Hanson, D.A.      1270; see “Duffiis D.A.”
Hanssens, G.      682
Hara, T.      1940
Harary, F.      65 276 304 1060 1162 1195 1213 1497
Harary, F.A.      316 321; J.”
Harary, F.B.      316; see “Beineke L.W.”
Harary, F.C.      1475; see “Blass A.”
Harary, F.D.      308 537; G.”
Harary, F.E.      1347; see “Chvatal V.”
Harary, F.F.      842 844; P.”
Harborth, H.      820 821 837 839 843 847 848 862 1336
Hard hexagon      1941
Hard Lefschetz theorem      1839
Hardy — Ramanujan Tauberian theorem      1124
Hardy, G.H.      1125 1152 2174
Harmonic function      1744
Harper, L.H.      1111 1297
Harper, L.H.A.      2051; see “Rota G.-C.”
Harrington, L.      626 640 1510; G.L.”
Harrington, L.A.      1377; see “Abramson F.G.”
Harrington, L.B.      1353; see “Paris J.”
Harris, A.J.      277; see “Bollobas B.”
Harris, B.      1177 1180
Harris, T.E.      1935
Hartman, A.      712 714
Hartman, A.A.      704; see “Hanani H.”
Hartman, I.B.A.      10
Hartman, I.B.A.A.      50; see “Aharoni R.”
Hartmanis, J.      1628
Hartmann, M.      957; see “Cook W.”
Hartshorne, R.      1839
Hartvigsen, D.      220; see “Cornuejols G.”
Harzheim, E.      474
Hasse diagram      312 436
Hasse — Minkowski theory      2183
Hasselbarth, W.      1965
Hasselbarth, W.A.      1960; see “Ruch E.”
Hassin, R.      573 576
Hastad, J.      958 1803 2013
Hat-check girl problem      1790
Hattori, A.      2070
Hauptsatz (of Polya)      1962
Hausler, D.      1299; see “Blumer A.”
Hausmann, D.      1678
Hausmann, D.A.      582 1547; B.”
Haussler, D.      1577
Havel, X.      579; see “Dress A.”
Haviland, J.      377
Hayashi, E.K.      990
Hayden, J.L.      715 804; W.G.”
Hayman, W.K.      1177—1179
Hayman-admissible      1177
Hayward, R.      269
Hcdayal, A.      1710; see “Foody W.”
Hctyci, G.      195 197
Head of a digraph      15
Head of a walk      16
Heap      2020
Heath-Brown, D.R.      1011
Heawood conjecture      323
Heawood graph      19 63 64 1452
Heawood number      261
Heawood theorem      260
Heawood, P.J.      237 260 261
Heawood’s formula      260 261
Hecke, E.      1438
Hedayat, A.      730
Hedetniemi, S.      276; see “Chartrand G.”
Hedetniemi, S.A.      276; see “Harary F.”
Hedlund, G.A.      714; see “Fort Jr.
Hedrlin, Z.      1461 1499 1511 1514
Hedrlin, Z.A.      1461; see “Vopenka P.”
Heesch, H.      238
Heffter, L.      261 320
Hegyvari, N.      1013; see “Erdos P.”
Height function      497
Heights of binary trees      1199
Heilbronn’s problem      861
Heilmann, C.J.      1941
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
blank
Ðåêëàìà
blank
blank
HR
@Mail.ru
       © Ýëåêòðîííàÿ áèáëèîòåêà ïîïå÷èòåëüñêîãî ñîâåòà ìåõìàòà ÌÃÓ, 2004-2024
Ýëåêòðîííàÿ áèáëèîòåêà ìåõìàòà ÌÃÓ | Valid HTML 4.01! | Valid CSS! Î ïðîåêòå