Skip to main content
SpringerLink
Log in

Packing and Covering Triangles in Tripartite Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 It is shown that if G is a tripartite graph such that the maximum size of a set of pairwise edge-disjoint triangles is , then there is a set C of edges of G of size at most , such that for every triangle T of G, where . This improves the previous bound of due to Tuza [6].

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1.  Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1. e-mail: pehaxell@math.uwaterloo.ca, , , , , , CA

    P. E. Haxell

  2.  Instituto de Matemática e Estatística, Universidade de São Paulo, Cidade Universitária, Rua do Matão 1010, 05508-900 São Paulo, SP, Brazil. e-mail: yoshi@ime.usp.br, , , , , , BR

    Y. Kohayakawa

Authors
  1. P. E. Haxell
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Y. Kohayakawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Haxell, P., Kohayakawa, Y. Packing and Covering Triangles in Tripartite Graphs. Graphs Comb 14, 1–10 (1998). https://doi.org/10.1007/s003730050010

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730050010

Keywords

Search

Navigation