Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
1 answer
777 views

Is there a term for a subgraph which includes all the edges of a graph?

A subgraph is called spanning when it includes all of the vertices of the given graph. Is there a term for a subgraph which includes all the edges of a graph? Thanks.
Tim's user avatar
  • 357
1 vote
1 answer
102 views

How do I fit flow values to connections in a known network?

This is not my area and I'm new to its terminology, and am posting my problem in the hope that someone will be able to direct me to where it has been solved, or who has written about it. I have a flow ...
hmkc's user avatar
  • 11
1 vote
0 answers
66 views

Set functions satisfying if $f(X) \le f(Y)$ and $Z \cap (X \cup Y) = \emptyset$, then $f(X \cup Z) \le f(Y \cup Z)$

I am investigating set functions $f : 2^\Omega \to \mathbb{N}$ satisfying the following two properties: (monotone) For all $X, Y \subset \Omega$, if $X \subseteq Y$, then $f(X) \le f(Y)$. (property ...
Glenn Sun's user avatar
  • 151