Highly Influenced

# Fractional Triangle Decompositions in Graphs with Large Minimum Degree

@article{Dross2016FractionalTD, title={Fractional Triangle Decompositions in Graphs with Large Minimum Degree}, author={François Dross}, journal={SIAM J. Discrete Math.}, year={2016}, volume={30}, pages={36-42} }

- Published 2016 in SIAM J. Discrete Math.
DOI:10.1137/15M1014310

A triangle decomposition of a graph is a partition of its edges into triangles. A fractional triangle decomposition of a graph is an assignment of a nonnegative weight to each of its triangles such that the sum of the weights of the triangles containing any given edge is one. We prove that every graph on n vertices with minimum degree at least 0.9n has a fractional triangle decomposition. This improves a result of Garaschuk that the same conclusion holds for graphs with minimum degree at least… CONTINUE READING