Packing triangles in K₄-free graphs

DOI10.1007/S00373-013-1300-5zbMATH Open1291.05099OpenAlexW2092251631MaRDI QIDQ2014715FDOQ2014715

S. C. Huang, Lingsheng Shi

Publication date: 16 June 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1300-5

zbMATH Keywords

trianglepacking[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs%27+conjecture&go=Go Erd��s' conjecture]edge-disjoint

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Flag algebras
• Some Theorems on Abstract Graphs
• Lower bounds on the number of triangles in a graph
• On the Minimal Density of Triangles in Graphs
• On the number of complete subgraphs and circuits contained in graphs
• On a theorem of Rademacher-Turán
• On the number of edge disjoint cliques in graphs of given size
• Graphs with small independence number minimizing the spectral radius

Cited In (5)

• Triangle packings and 1-factors in oriented graphs
• A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing
• Packing and covering triangles in \(K_{4}\)-free planar graphs
• On the number of edge-disjoint triangles in \(K_4\)-free graphs
• On the number of edge-disjoint triangles in \(K_4\)-free graphs

This page was built for publication: Packing triangles in \(K_4\)-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014715)