|
|
|
|
|
|
by anon291
229 days ago
|
|
|
Nice! I wonder if there's a mathematical theorem to describe the possible shapes for a 2-d venn diagram of N sets or if there's an N for which it is no longer possible (or maybe it's possible for all N!?). Probably an application of graph theory and Euler's formula to determine feasibility and then something else to figure out the shape constraints. Never thought about it, but an interesting idea. |
|
|