161
click to vote
JCT
2010
15 years 1 months ago
2010
Let m1, m2, . . . , mt be a list of integers. It is shown that there exists an integer N such that for all n ≥ N, the complete graph of order n can be decomposed into edge-disjo...
109
Voted
DM
2010
15 years 3 months ago
2010
For a graph G let