Continuous selection theorem, coincidence theorem and intersection theorems concerning sets with H-convex sections

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applications of a Theorem concerning Sets with Connected Sections

As the reader can notice, the title of the present paper differs from that of [3] only because the term connected replaces the term convex. This is not casual. Indeed, it remains our aim to show, by means of a series of further applications, the usefulness of our recent Theorem 2.3 of [6] which, in a certain sense, can be regarded as a “connected” version of the famous Theorems 1′ and 2 of [3]....

متن کامل

Some fixed point theorems and common fixed point theorem in log-convex structure

Some fixed point theorems and common fixed point theorem in Logarithmic convex structure areproved.

متن کامل

An intersection theorem for systems of sets

Erdos and Rado defined a A-system, as a family in which every two members have the same intersection. Here we obtain a new upper bound on the maximum cardinality q ( n , q ) of an n-uniform family not containing any A-system of cardinality q. Namely, we prove that, for any a > 1 and q , there exists C = C(a, q ) such that, for any n ,

متن کامل

An intersection theorem for weighted sets

A weight function ! : 2 → R¿0 from the set of all subsets of [n]={1; : : : ; n} to the nonnegative real numbers is called shift-monotone in {m+1; : : : ; n} if !({a1; : : : ; aj})¿!({b1; : : : ; bj}) holds for all {a1; : : : ; aj}; {b1; : : : ; bj}⊆ [n] with ai6bi; i = 1; : : : ; j, and if !(A)¿!(B) holds for all A; B⊆ [n] with A⊆B and B\A⊆{m + 1; : : : ; n}. A family F⊆ 2 is called intersectin...

متن کامل

An intersection theorem for four sets

Fix integers n, r ≥ 4 and let F denote a family of r-sets of an n-element set. Suppose that for every four distinct A,B,C,D ∈ F with |A∪B ∪C ∪D| ≤ 2r, we have A∩B ∩C ∩D 6= ∅. We prove that for n sufficiently large, |F| ≤ ( n−1 r−1 ) , with equality only if ⋂ F∈F F 6= ∅. This is closely related to a problem of Katona and a result of Frankl and Füredi [10], who proved a similar statement for thre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics

سال: 1992

ISSN: 0263-6115

DOI: 10.1017/s1446788700032833