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

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

blank
blank
blank
Красота
blank
Berge C. — Hypergraphs. Volume 45
Berge C. — Hypergraphs. Volume 45



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



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


Название: Hypergraphs. Volume 45

Автор: Berge C.

Язык: en

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

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

ed2k: ed2k stats

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
$\beta$-degree $d^{\beta}_{H}(x)$      ch.4 §2
$\beta$-degree (maximum) $\Delta_{\beta}(H)$      ch.4 §1
$\beta$-star      ch.4 §1
$\tau$-critical hypergraph      ch.2 §3
(n, k, $\lambda$)-design      ch.2 §2
Affine plane      ch.2 §2
Anti-rank s(H)      ch.1 §1
Arboreal hypergraph      ch.5 §4
B-cycle      ch.5 §7
Balanced hypergraph      ch.5 §3
Balanced hypergraph (totally)      ch.5 §3
Baranyai theorem      ch.4 §5
Canonical 2-matching      ch.3 §2
Chromatic index (fractional) q*(G)      ch.2 §4
Chromatic index q(H)      ch.1 §4
Chromatic number $\chi(H)$      ch.2 §1 (ch.4 §1)
Chromatic number (strong) $\gamma(H)$      ch.4 §2
Chvatal conjecture      ch.1 §4
Co-arboreal hypergraph      ch.4 §4
Coloured edge property      ch.1 §4
Colouring (equitable)      ch.4 §2
Colouring (good)      ch.4 §2
Colouring (regular)      ch.4 §2
Colouring (strong)      ch.4 §2
Colouring (uniform)      ch.4 §2
Complete r-partite hypergraph $K^{r}_{n_{1}, n_{2}, ...n_{r}}$      ch.1 §4
Complete, r-complete (hypergraph) $K^{r}_{n}$      ch.1 §2
Connected hypergraph      ch.1 §2
Covering      ch.2 §4
Covering number $\rho(H)$      ch.2 §4
Critical vertex      ch.2 §3
Cycle of length k      ch.5 §1
Cyclomatic number $\mu(H)$      ch.5 §4
Degree $d_{H}(x)$      ch.1 §2
Degree (maximum) $\Delta(H)$      ch.1 §2
Dependent set      Appendix §1
Distinct representatives      Appendix §1
Dual hypergraph H*      ch.1 §1
Duplication      ch.5 §3
EDGE      ch.1 §1
Erdoes problem      ch.4 §6
Erdoes, Chao-Ko, Rado (theorem of)      ch.1 §3
Fan $F_{r}$      ch.2 §1
Fan (generalized)      ch.2 §1
Fournier — Las Vergnas (theorem of)      ch.5 §1
Graph G      ch.1 §1
Gupta property      ch.5 §7
Helly property      ch.1 §5
Hereditary closure $\hat{H}$      ch.1 §4
Hypergraph      ch.1 §1
Incidence matrix      ch.1 §1
Independent set      Appendix §1
Intersecting family      ch.1 §3
Interval hypergraph      ch.1 §5
k-colouring      ch.4 §1
k-Helly      ch.1 §5
k-matching number $\nu_{k}(H)$      ch.3 §1
k-section $[H]_{k}$      ch.1 §6
k-stability number $\bar{\alpha}_{k}(H)$      ch.3 §1
k-stable (strongly)      ch.3 §1
k-star      Appendix §1
k-transveresal $\tau_{k}(H)$      ch.3 §1
k-transversal number $\tau_{k}(H)$      ch.3 §1
Kneser number $\tau_{0}(H)$      ch.4 §7
Koenig property      ch.2 §4
Kruskal — Katona (theorem of)      ch.1 §6
Line-graph L(H)      ch.1 §8
Linear hypergraph      ch.1 §2
Lovasz hypergraph      ch.2 §1
Lovasz inequality      ch.5 §4
Lovasz theorem      ch.5 §4
Matching      ch.2 §4
Matching (fractional)      ch.3 §1
Matching number $\nu(H)$      ch.2 §4
Mengerian hypergraph      ch.5 §7
Multigraph      ch.1 §1
Normal hypergraph      ch.5 §6
Number of edges m(H)      ch.1 §1
Order n(H)      ch.1 §1
Paranormal hypergraph      ch.5 §8
Partial hypergraph      ch.1 §1
Partial hypergraph (generated by A) H/A      ch.4 §1
Polyomino      ch.2 §4
Positional game on H      ch.4 §3
Projective plane      ch.2 §2
Quasi-regularisable hypergraph      ch.3 §3
r-uniform hypergraph      ch.1 §1
Ramsey numbers R(p,q)      ch.3 §6
Rank of a hypergraph r(H)      ch.1 §1
Rank of a matroid      Appendix §1
Regular hypergraph      ch.1 §2
Regularisable hypergraph      ch.3 §3
Representative graph L(H)      ch.1 §8
Ryser conjecture      ch.3 §5
s-covering      ch.3 §1
s-covering number $\rho_{s}(H)$      ch.3 §1
S-cut      ch.5 §7
S-joint      ch.5 §8
Separable      ch.1 §2
Seymour theorem      ch.2 §4
Simple hypergraph      ch.1 §1
Sperner theorem      ch.1 §2
Stability number $\alpha(H)$      ch.4 §1
Stability number (strong) $\bar{\alpha}(H)$      ch.2 §4
Stable (strongly) set      ch.2 §4
Stable set      ch.2 §1
Star H(x)      ch.1 §2
Steiner system      ch.1 §2
Sterboul conjecture      ch.5 §1
Sub-hypergraph (induced)      ch.1 §1
Sub-hypergraph (partial)      ch.1 §1
Transversal (fractional)      ch.3 §1
Transversal hypergraph TrH      ch.2 §1
Transversal number $\tau(H)$      ch.2 §2
Transversal number (associated) $\tau^{'}(H)$      ch.2 §2
Transversal number (fractional) $\tau^{*}(H)$      ch.3 §1
Transversal number (greedy) $\tilde{\tau}(H)$      ch.3 §4
Transversal set      ch.2 §1
Turan number T(n,p,r)      ch.4 §4
Uniform hypergraph      ch.1 §1
Unimodular hypergraph      ch.5 §2
Unimodular matrix (totally)      ch.5 §2
Vertex      ch.1 §1
Vertex-colouring lemma      ch.2 §1
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2021
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте