Install Steam
login
|
language
简体中文 (Simplified Chinese)
繁體中文 (Traditional Chinese)
日本語 (Japanese)
한국어 (Korean)
ไทย (Thai)
Български (Bulgarian)
Čeština (Czech)
Dansk (Danish)
Deutsch (German)
Español - España (Spanish - Spain)
Español - Latinoamérica (Spanish - Latin America)
Ελληνικά (Greek)
Français (French)
Italiano (Italian)
Bahasa Indonesia (Indonesian)
Magyar (Hungarian)
Nederlands (Dutch)
Norsk (Norwegian)
Polski (Polish)
Português (Portuguese - Portugal)
Português - Brasil (Portuguese - Brazil)
Română (Romanian)
Русский (Russian)
Suomi (Finnish)
Svenska (Swedish)
Türkçe (Turkish)
Tiếng Việt (Vietnamese)
Українська (Ukrainian)
Report a translation problem
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.
___________________________######_________
___________________________######_________
____________________________####__________
_____________________________##___________
___________________________######_________
__________________________#######_________
__####__________________#########_________
_######________________###_######_________
_######_______________###__######_________
__####_______________###___######_________
_____##################____######_________
_____##################+rep#######________
______#################____######_________
_______###_______#####_____######_________
______###_______#####______######_________
_____###________#####______######_________
#######_________##########_##############__
___________________________________________