Packing triangles in \(K_4\)-free graphs
type: Item
instance of: scholarly article
title: Packing triangles in \(K_4\)-free graphs
zbMATH Open document ID: 1291.05099
author: S. C. Huang
author: Lingsheng Shi
published in: Graphs and Combinatorics
publication date: 2014-06-16T00:00:00Z
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6304673
zbMATH Keywords: Erdős' conjecture
zbMATH Keywords: edge-disjoint
zbMATH Keywords: packing
zbMATH Keywords: triangle
MaRDI profile type: Publication
full work available at URL: s00373-013-1300-5
OpenAlex ID: W2092251631
cites work: Q5315023
cites work: Some Theorems on Abstract Graphs
cites work: Graphs with small independence number minimizing the spectral radius
cites work: On a theorem of Rademacher-Turán
cites work: On the number of complete subgraphs and circuits contained in graphs
cites work: Lower bounds on the number of triangles in a graph
cites work: On the number of edge disjoint cliques in graphs of given size
cites work: Flag algebras
cites work: On the Minimal Density of Triangles in Graphs
cites work: Q5781249
DOI: 10.1007/S00373-013-1300-5
description: scientific article; zbMATH DE number 6304673