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

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

blank
blank
blank
Красота
blank
Bryant V.W., Perfect H. — Independence Theory in Combinatorics
Bryant V.W., Perfect H. — Independence Theory in Combinatorics



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



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


Название: Independence Theory in Combinatorics

Авторы: Bryant V.W., Perfect H.

Язык: en

Рубрика: Математика/

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

ed2k: ed2k stats

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Affine independence      8
Affine independence, rank      9
Affine independence, subspace      9
Affinely independent set      8
Affinely independent set, representable      107
Algorithmic construction of heaviest bases      24
Algorithmic construction of heaviest bases, proof of Hall’s theorem      68
Alternating path      70 75
ARC      48
Base orderability      103
Bases, algorithm for heaviest      24
Bases, axioms for      16 17
Bases, equal cardinality of      14
Bases, of a maximum weight (heaviest)      24 25
Bases, of a vector space      7
Bases, of an independence space      14
Binary independence space      112
Bipartite graph      5 29
Bipartite graph, complete      5
Bipartite graph, independence structures induced by      29 32
Birkhoff, G.      2
Cardinality of a set      3
Characteristic of a field      113
Characteristic of a field, set      113
Circuit (in an independence space)      15
Circuit (in an independence space), space      38
Circuits, axioms for      16 17
Circuits, fundamental set of      37
Common partial transversal      95
Common partial transversal, transversal      86
Complete bipartite graph      5
Complete bipartite graph, graph      4
Component of a graph      5
Connected graph      5
Connected graph, independence space      37
Connected graph, set of edges      62
Contraction of a graph      60
Contraction of a vector space      37
Contraction of an independence structure      20
Cutset (in a graph)      43
Cutset (in a graph), space      43
Cutset (in a graph), structure      43
Cycle (in a graph)      41
Cycle (in a graph), space      41
Cycle (in a graph), structure      41
Degree of a vertex      3
Dependence, axioms for      2 36
Dependence, relation of      2
Dependent set      13
Dimension of a vector space      7
Direct sum of independence structures      21
Directed graph      80
Disconnecting set of edges      43
Disjoint paths      80
Distinct representatives      66
Dual indepedence structures      22
Dual indepedence structures, rank of      22
Dual, geometric (of planar graph)      47
Dual, of transversal structure      79 83
Dual, structures in a graph      45
Edge (in a graph)      3
Edge (in a graph), directed      80
Edge (in a graph), endpoints of      3
Edge-set (through a vertex)      53
Endpoint of a path      5
Endpoint of an edge      3
Erection      39
Euler’s formula      56
Face of a planar representation      47
Family of elements      3
Family of sets      3
Fano geometry      102
Finite-dimensional vector space      6 7
Finiteness assumption      2
Flat (in an independence space)      19
Flat (in an independence space), as intersection of hyperplanes      37
Flat (in an independence space), spanned by a set      19
Forests (in a graph)      5
Forests (in a graph), partitioning into      58
Fundamental set of circuits      37
Gammoid      82
Gammoid, strict      82
Geometric dual of planar graph      47
Graph      3
Graph, bipartite      5
Graph, complete      4
Graph, complete bipartite      5
Graph, connected      5
Graph, directed      80
Graph, planar      46
Graphic spaces      45
Graphoid      40
Greedy algorithm      24
Hall, P.      2 66
Hall’s theorem      68
Hamiltonian path      95
Heaviest bases      24
Hereditary property of independent sets      13
Hyperplane      37
Incidence matrix of a family of sets      130
Incidence matrix of a graph      55
Independence, affine      8
Independence, associated with a family of sets      75
Independence, linear      6
Independence, on a graph      41 43
Independence, space      13
Independence, structure      13
Independent sets, axioms for      13
Independent sets, transversal      67
Induced structures      20 29
Initial vertex      80
Isomorphism of independence structures      49
Join of vertices by a path      5
Join of vertices by an edge      3
Latin rectangle      89
Latin rectangle, square      89
Linear independence      6
Linear independence, rank (or dimension)      7
Linear independence, representability      104
Linear independence, representability of graphic spaces      105
Linear independence, representability of induced spaces      108
Linear independence, representability of transversal spaces      105
Linearly dependent set      6
Linearly dependent set, independent set      6
Linkage theorem      84
Linked sets      81
MacLane S.      2
Mapping, rank preserving      104
Matching (in a graph)      5 30
Matching (in a graph), structure      99
Matroid      1 2
Menger, K.      88
Menger’s theorem      89 97
Minimal presentation of a transversal structure      96
Minor of an independence space      102
Partial transversal      65
Path, Hamiltonian      95
Path, in a directed graph      80
Path, in a graph      5
Path, initial and terminal vertices of      80
Permutation product      78
Planar graph      46
Planar graph, geometric dual of      47
Planar representation      46
Planar representation, face of      47
Power set      3
Pre-geometry      1
Presentation of transversal structure      96
Presentation of transversal structure, minimal      96
Product of independence structures      40
Product of vectors      9
Proper truncation      26
Quotient space      37
Rado, R.      2
Rado’s Theorem      74
Rank      15
Rank, axioms for      16 26
Rank, function      15
Rank-preserving mapping      104
Regular independence space      112
Replacement property of independent sets      13
Replacement property of independent sets, theorems (an a vector space)      6 8
Representability of an independence space      101
Representability of an independence space, affine      107
Representability of an independence space, linear      104
Representability of an independence space, of induced structures      108
Representatives of a family of sets      94
Representatives of a family of sets, distinct      66 94
Restriction of an independence structure      14
Separation (in a directed graph)      88
span      19
Spanning set      37
Spanning set, tree      42
Star (in a directed graph)      81
Strict gammoid      82
Subfamily      3 87
Submodular function      28
Submodular function, inequality      15
Submodular function, structures induced by      26
Sum of independence structures      33
Sum of independence structures, direct      21
Symmetric difference      2
System of representatives      94
System of representatives, distinct      66 94
Terminal vertex      80
Translate of a set of vectors      8
Transversal of a family of sets      65
Transversal of a family of sets, common      86
Transversal of a family of sets, independent      67
Transversal of a family of sets, partial      65
Transversal space      75
Transversal space, dual of      79 83
Transversal space, structure      75
TREE      5
Tree, spanning      42
Truncation of an independence structure      26
Truncation of an independence structure, proper      26
Tutte, W.T.      2 102
Tutte, W.T., characterization theorems of      2 102
Undirected strict gammoid      97
Universal structure      14
Vamos space      114
Van der Waerden, B.L.      2
Van der Waerden, B.L., dependence axioms of      2 36
Vector spaces, affine independence in      8
Vector spaces, associated with graphic spaces      50 54
Vector spaces, associated with transversal spaces      75 77
Vector spaces, linear independence in      6
Vertex (in a graph)      3
Vertex (in a graph), degree of      3
Weight      24 57
Wheel      62
Whitney, H.      2
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2020
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте