I will mention two of my favourite problems in which recently important progress was made. The other questions I will mention are perhaps less well known. 1. Faber, Lowisz and I conjectured more than 20 years ago that if Gi, 1 <<.i~n are n G n edge disjoint complete graphs of size n then Ui=l i has
Some new computer generated results in Ramsey graph theory
β Scribed by G. Exoo
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 191 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
If F, G, and H are graphs, write F ~ (G,/-/) to mean that however the edges of F are colored red and blue, either the red (partial) subgraph contains a copy of G or the blue subgraph contains a copy of H. Many interesting questions exist concerning this relation, particularly involving the case in w
In this paper, a new method for calculating effective atomic radii within the generalized Born (GB) model of implicit solvation is proposed, for use in computer simulations of biomolecules. First, a new formulation for the GB radii is developed, in which smooth kernels are used to eliminate the dive