Density conditions for triangles in multipartite graphs
From MaRDI portal
Publication:858108
DOI10.1007/s00493-006-0009-yzbMath1174.05406OpenAlexW1986746825WikidataQ56926676 ScholiaQ56926676MaRDI QIDQ858108
Adrian Bondy, Jian Shen, Steéphan Thomassé, Carsten Thomassen
Publication date: 8 January 2007
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00140328
Related Items
Complete subgraphs in a multipartite graph, Bounded transversals in multipartite graphs, A note on bipartite subgraphs and triangle-independent sets, The Density Turán Problem, Additive approximation for edge-deletion problems, Complete subgraphs in multipartite graphs, On a Conjecture of Erdős, Gallai, and Tuza, Bipartite Hansel results for hypergraphs, The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm, \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups, Strong Turán stability, On the minimal degree condition of graphs implying equality of the largest \(K_r\)-free subgraphs and \((r - 1)\)-partite subgraphs, On cyclic and nontransitive probabilities, Long paths and connectivity in 1‐independent random graphs, Triangle-degrees in graphs and tetrahedron coverings in 3-graphs, A Density Turán Theorem
