Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T11:54:16.509Z Has data issue: false hasContentIssue false

The minimal density of triangles in tripartite graphs

Part of:Graph theory

Published online by Cambridge University Press:  01 August 2010

Rahil Baber
Affiliation:
Department of Mathematics, UCL, Gower Street, London WC1E 6BT, United Kingdom (email: rahilbaber@hotmail.com)
J. Robert Johnson
Affiliation:
School of Mathematical Sciences, Queen Mary University of London E1 4NS, United Kingdom (email: r.johnson@qmul.ac.uk)
John Talbot
Affiliation:
Department of Mathematics, UCL, Gower Street, London WC1E 6BT, United Kingdom (email: talbot@math.ucl.ac.uk)

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We determine the minimal density of triangles in a tripartite graph with prescribed edge densities. This extends a previous result of Bondy, Shen, Thomassé and Thomassen characterizing those edge densities guaranteeing the existence of a triangle in a tripartite graph. To be precise we show that a suitably weighted copy of the graph formed by deleting a certain 9-cycle from K3,3,3 has minimal triangle density among all weighted tripartite graphs with prescribed edge densities.

Supplementary materials are available with this article.

MSC classification

Information

Type
Research Article
Copyright
Copyright © London Mathematical Society 2010
Supplementary material: File

Baber Supplementary Material

Supplementary material.zip

Download Baber Supplementary Material(File)
File 7.6 KB