In this note we investigate Ramsey properties of random graphs. The threshold functions for symmetric Ramsey properties with respect to vertex colorings were determined by tuczak, Rucinski, and Voigt . As a generalization of this problem we consider asymmetric Ramsey properties and establish the val
Threshold functions for asymmetric Ramsey properties involving cycles
β Scribed by Y. Kohayakawa; B. Kreuter
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 338 KB
- Volume
- 11
- Category
- Article
- ISSN
- 1042-9832
No coin nor oath required. For personal study only.
β¦ Synopsis
We consider the binomial random graph G and determine a sharp threshold p function for the edge-Ramsey property G Βͺ C l 1 , . . . , C l r Ε½ . p for all l , . . . , l , where C l denotes the cycle of length l. As deterministic consequences of 1 r
our results, we prove the existence of sparse graphs having the above Ramsey property as well as the existence of infinitely many critical graphs with respect to the property above.
π SIMILAR VOLUMES
## Abstract To obtain a bioartificial kidney composed of a porous polymer membrane and renal cells, a polysulfone (PSf) membrane (PSM) blended with 2βmethacryloyloxyethyl phosphorylcholine (MPC) polymer was prepared. The PSM flat membrane with a porous structure could be prepared from the polymer b