On the Minimum Degree Required for a Triangle Decomposition

DOI10.1137/19M1284610zbMath1431.05120arXiv1908.11076OpenAlexW3010331036MaRDI QIDQ5218438

Daniel Horsley, Peter J. Dukes

Publication date: 4 March 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.11076

zbMATH Keywords

network flowtriple systemedge-decomposition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (2)

Progress towards Nash-Williams' conjecture on triangle decompositions ⋮ Sharp bounds for decomposing graphs into edges and triangles

Cites Work

• Progress towards Nash-Williams' conjecture on triangle decompositions
• Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions
• Fractional Triangle Decompositions in Graphs with Large Minimum Degree
• Edge-decompositions of graphs with high minimum degree

This page was built for publication: On the Minimum Degree Required for a Triangle Decomposition