Recent results on saturation and CGC
β Scribed by K. Itakura
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 283 KB
- Volume
- 774
- Category
- Article
- ISSN
- 0375-9474
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Unequivocal identification of unknown pollutants is very difficult if only one dimension of information is used. Combining different hyphenated techniques can, on the other hand, lead to more reliable identification. Combination of the data provided by the different techniques is more i
Truszczynski, M. and Z. Tuza, Asymptotic results on saturated graphs, Discrete Mathematics 87 (1991) 309-314 Let F be a given graph. A graph G is called F-saturated if F & G and F c G + e for every edge e $ E(G), e E V(G). Denote by sat(n, F) the minimum number of edges in an F-saturated graph on n