A conjecture on triangles of graphs |
| |
| Authors: | Zsolt Tuza |
| |
| Affiliation: | (1) Computer and Automation Institute, Hungarian Academy of Sciences, Kende u. 13-17, H-1111 Budapest, Hungary |
| |
| Abstract: | We give various results related to the following conjecture: If a graphG does not contain more thank pairwise edge-disjoint triangles, then there exists a set of at most 2k edges that meets all triangles ofG.Some of the results were presented at the Conference on Combinatorics, Optimization and Statistics, Srinagar, India, August 1987. Research supported in part by the  AKA Research Fund of the Hungarian Academy of Sciences, grant 1-3-86-264. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
