Near Matches
Ignore Exact
Everything
2
stable set (thing)
See all of stable set
, no other writeups in this node.
Confirm
Do you really want to send artemis entreri a message saying you like their work?
OK
X
(
thing
)
by
artemis entreri
Sun Feb 11 2001 at 5:58:56
In
combinatorics
, a
set
of
nodes
in a
graph
is called
stable
if none of them are joined to one another.
--back to
combinatorics
--
Combinatorics
Possession