Instalar Steam
iniciar sesión
|
idioma
简体中文 (chino simplificado)
繁體中文 (chino tradicional)
日本語 (japonés)
한국어 (coreano)
ไทย (tailandés)
Български (búlgaro)
Čeština (checo)
Dansk (danés)
Deutsch (alemán)
English (inglés)
Español de Hispanoamérica
Ελληνικά (griego)
Français (francés)
Italiano
Bahasa Indonesia (indonesio)
Magyar (húngaro)
Nederlands (holandés)
Norsk (noruego)
Polski (polaco)
Português (Portugués de Portugal)
Português-Brasil (portugués de Brasil)
Română (rumano)
Русский (ruso)
Suomi (finés)
Svenska (sueco)
Türkçe (turco)
Tiếng Việt (vietnamita)
Українська (ucraniano)
Comunicar un error de traducción
99999966999999669996696699999966999669
99999966999999669996696699999966999669
96666666666669666666696666666966666669
99999966999999669669996699999966999999
99999966999999669966996699999966999999
99999999999999669996696666666966999999
step 1: Highlight text
step 2: Press Ctrl+f
step 3: Press 6
step 4: Enjoy the truth
to meet prescribed local connectivity requirements. We provide here a
minimax theorem for this problem. The result is derived from the degree constrained
version of the problem by a standard method. We shall construct the
required hypergraph for the latter problem by a greedy type algorithm. A similar
minimax result will be given for the problem of augmenting a hypergraph
by weighted edges (hyperedges of size two with weights) to meet prescribed local
connectivity requirements. Moreover, a special case of an earlier result of
Schrijver on supermodular colourings shall be derived from our theorem.