Probabilistic methods in graph theory
✍ Scribed by V. Chvátal
- Book ID
- 112644118
- Publisher
- Springer US
- Year
- 1984
- Tongue
- English
- Weight
- 382 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0254-5330
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This lecture is mainly a survey of useful probabilistic methods in the theoretical analysis of fuzzy theory for modeling and design of intelligent systems. The probabilistic methods also are useful for fusing domain knowledge with numerical data in the field of intelligent data analysis.
Consider two maps f and g from a set E into a set F such that f (x) = g(x) for every x in E. What is the maximal cardinal of a subset A of E such that the images of the restriction of f and g to A are disjoint? Mekler, Pelletier and Taylor have shown that it is card(E) when the set E is infinite; in
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology to graph coloring problems will be presented. In particular, the following subjects will be treated: The use of Euler's f