Conversely, a portion of a graph in which no vertex is connected to any other vertex is called an anticlique, or stable set. The mathematician Paul Erdős was prolific in this area, proving numerous ...

Every link in ℝ3 can be represented by a one-vertex ribbon graph. We prove a Markov type theorem on this subset of link diagrams. Journal Information This monthly journal, begun in 1950, is devoted ...