Search Results for ""

The term folium means "leaf" in Latin and refers and refers to a plane curve having "leaf-shaped" rounded lobes. There are a number of different sorts of folia, including ...

A graph is a forbidden (vertex-)induced subgraph if its presence as a vertex-induced subgraph of a given graph means it is not a member of some family of graphs. For example, ...

A graph is a forbidden subgraph if its presence as a subgraph of a given graph means it is not a member of some family of graphs. For example, a bipartite graph is a graph ...

A graph is a forbidden topological minor (also known as a forbidden homeomorphic subgraph) if its presence as a homeomorphic subgraph of a given graph (i.e., there is an ...

When referring to a planar object, "free" means that the object is regarded as capable of being picked up out of the plane and flipped over. As a result, mirror images are ...

A group action G×X->X is called free if, for all x in X, gx=x implies g=I (i.e., only the identity element fixes any x). In other words, G×X->X is free if the map G×X->X×X ...

This is sometimes knows as the "bars and stars" method. Suppose a recipe called for 5 pinches of spice, out of 9 spices. Each possibility is an arrangement of 5 spices ...

The generalized diameter is the greatest distance between any two points on the boundary of a closed figure. The diameter of a subset E of a Euclidean space R^n is therefore ...

The graph neighborhood of a vertex v in a graph is the set of all the vertices adjacent to v including v itself. More generally, the ith neighborhood of v is the set of all ...

A group automorphism is an isomorphism from a group to itself. If G is a finite multiplicative group, an automorphism of G can be described as a way of rewriting its ...