## Abstract Given graphs __G__ and __H__, an edge coloring of __G__ is called an (__H__,__q__)βcoloring if the edges of every copy of __H__ β __G__ together receive at least __q__ colors. Let __r__(__G__,__H__,__q__) denote the minimum number of colors in a (__H__,__q__)βcoloring of __G__. In 9 Erd
An application of Ramsey sets in analysis
β Scribed by T Figiel; L Sucheston
- Publisher
- Elsevier Science
- Year
- 1976
- Tongue
- English
- Weight
- 132 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0001-8708
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A known theorem states that there is a function f = f(k) such that every tournament T with at least f(k) vertices contains a transitive subtournament on k vertices. In this paper, the concept of an ordered r-tournament is introduced and the existence of an analogous function to f = f(k) is establish
In this paper we study the Sanchez's approach for medical diagnosis and extend this concept with the notion of intuitionistic fuzzy set theory (which is a generalization of fuzzy set theory).
this paper, we apply the theory of soft sets to solve a decision making problem using rough mathematics.