Premium
On the Maximal Number of Edges in Graphs with a Given Number of Edge‐Disjoint Triangles
Author(s) -
Sauer N.
Publication year - 1971
Publication title -
journal of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.441
H-Index - 62
eISSN - 1469-7750
pISSN - 0024-6107
DOI - 10.1112/jlms/s2-4.1.153
Subject(s) - disjoint sets , combinatorics , enhanced data rates for gsm evolution , mathematics , discrete mathematics , computer science , telecommunications