منابع مشابه
An algebraic approach to Halls matching theorem
The purpose of this note is to present a proof of Hall's matching theorem (also called marriage theorem) which I have not encountered elsewhere in literature-what yet does not mean that it is necessarily new. We refer to Hall's theorem in the following form: Theorem 1 (Hall). Let n be a positive integer. Let be a bipartite graph whose set of vertices consists of n blue vertices B 1 ; B 2 Some n...
متن کاملSymmetric Versions of Laman's Theorem
Recent work has shown that if an isostatic bar and joint framework possesses non-trivial symmetries, then it must satisfy some very simply stated restrictions on the number of joints and bars that are ‘fixed’ by various symmetry operations of the framework. For the group C3 which describes 3-fold rotational symmetry in the plane, we verify the conjecture proposed in [4] that these restrictions ...
متن کاملFUZZY QUASI-METRIC VERSIONS OF A THEOREM OF GREGORI AND SAPENA
We provide fuzzy quasi-metric versions of a fixed point theorem ofGregori and Sapena for fuzzy contractive mappings in G-complete fuzzy metricspaces and apply the results to obtain fixed points for contractive mappingsin the domain of words.
متن کاملPolynomial-Time Versions of Sylow's Theorem
Let G be a subgroup of S,, given in terms of a generating set of permutations, and let p be a prime divisor of 1 G 1. If G is solvable-and, more generally, if the nonabelian composition factors of G are suitably restricted-it is shown that the following can be found in polynomial time: a Sylow p-subgroup of G containing a given p-subgroup, and an element of G conjugating a given Sylow p-subgrou...
متن کاملComputable Versions of Baire's Category Theorem
We study different computable versions of Baire’s Category Theorem in computable analysis. Similarly, as in constructive analysis, different logical forms of this theorem lead to different computational interpretations. We demonstrate that, analogously to the classical theorem, one of the computable versions of the theorem can be used to construct interesting counterexamples, such as a computab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1971
ISSN: 0095-8956
DOI: 10.1016/0095-8956(71)90069-4