Sharp bounds for decomposing graphs into edges and triangles (2019)
Attributed to:
Extremal Combinatorics
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.48550/arxiv.1909.11371
Publication URI: https://arxiv.org/abs/1909.11371
Type: Other