Density Conditions for Triangles in Multipartite Graphs

Abstract : We consider the problem of finding a large or dense triangle-free subgraph in a given graph $G$. In response to a question of P. Erd\H{o}s, we prove that, if the minimum degree of $G$ is at least $17|V(G)|/20 $, the largest triangle-free subgraphs are precisely the largest bipartite subgraphs in $G$. We investigate in particular the case where $G$ is a complete multipartite graph. We prove that a finite tripartite graph with all edge densities greater than the golden ratio has a triangle and that this bound is best possible. Also we show that an infinite-partite graph with finite parts has a triangle, provided that the edge density between any two parts is greater than $1/2$.
Document type :
Journal articles
Complete list of metadatas

Cited literature [3 references]  Display  Hide  Download
Contributor : Stephan Thomasse <>
Submitted on : Monday, June 11, 2007 - 10:54:13 AM
Last modification on : Thursday, February 7, 2019 - 5:14:14 PM
Long-term archiving on : Wednesday, April 7, 2010 - 3:11:20 AM



Adrian Bondy, Jian Shen, Stéphan Thomassé, Carsten Thomassen. Density Conditions for Triangles in Multipartite Graphs. Combinatorica, Springer Verlag, 2006, 26, pp.121-131. ⟨⟩. ⟨10.1007/s00493-006-0009-y⟩. ⟨lirmm-00140328⟩



Record views


Files downloads