All Questions

A graph is called simple if there are no loops and there are no multiple edges. Is it possible to compute the number of non-isomorphic, simple, connected graphs with 6 vertices? If the number is known,...

Let $M=(X,f)$ be a multiset, where $X$ is the underlying set of elements and $f:X\rightarrow\mathbb{N}$ is the multiplicity function. For every $k\in\mathbb{N}$ put $k\cdot M:=(X,k\cdot f)$. It is ...

Consider a subset of $n$ points in an equilateral triangular lattice. Draw all the edges between nearest-neighbor points. What is the maximum, over all such subsets, of the number of edges? This ...

I've stumbled across this family of flow networks, and posted the sequence of maximal flows to OEIS: A238729. I can't find any reference to it either. Has anyone seen it? Here is the description: ...