1 paper · 1 filter
Max Aires
The saturation number sat(n,F) is the minimum number of edges in any graph which does not contain a member of F as a subgraph, but will if any edge i…