Sharp bounds for decomposing graphs into edges and triangles (2020)
Attributed to:
Extremal Combinatorics
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1017/s0963548320000358
Publication URI: https://api.elsevier.com/content/abstract/scopus_id/85095310345
Type: Journal Article/Review
Parent Publication: Combinatorics, Probability and Computing
Issue: 2