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.
Similar content being viewed by others
References
Dirac, G.A.: On rigid circuit graphs, Abh. Math. Sem. Univ. Hamb.25, 71–76 (1961)
Györi, E., Tuza, Zs.: Decompositions of graphs into complete subgraphs of given order. Stud. Sci. Math. Hung.22, 315–320 (1987)
Kirkman, T.P.: On a problem in combinatorics. Cambridge and Dublin Math. J.2, 191–204 (1847)
Lehel, J., Tuza, Zs.: Triangle-free partial graphs and edge covering theorems. Discrete Math.39, 59–65 (1982)
Mantel, W.: Problem 28, solution by Gouwentak, H., Mantel, W., Teixera de Mattes, J., Schuh F., and Wythoff, W.A., Wiskundige Opgaven10, 60–61 (1907)
Szemerédi, E., Tuza, Zs.: Upper bound for transversals of tripartite hypergraphs. Period. Math. Hung.13, 321–323 (1982)
Tuza, Zs.: Conjecture. In: Finite and Infinite Sets, Proc. Colloq. Math. Soc. János Bolyai, Eger (Hungary) 1981, North-Holland, p. 888
Tuza, Zs.: Ryser's conjecture for transversals ofr-partite hypergraphs. Ars Comb.16-B, 201–209 (1983)
Tuza, Zs.: On the order of vertex sets meeting all edges of a 3-partite hypergraph. Ars Comb.24A, 59–63 (1987)
Tuza, Zs.: Perfect triangle families (to appear)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tuza, Z. A conjecture on triangles of graphs. Graphs and Combinatorics 6, 373–380 (1990). https://doi.org/10.1007/BF01787705
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01787705