Chicken (game) respectively. The line in graph on the left shows the optimum probability of playing the escalated strategy for player Y as a function of "x". The line in the second graph shows the optimum probability of playing the escalated strategy for player X as a function of "y" (the axes have not been rotated, so the dependent variable is plotted on the abscissa, and the independent variable is plotted on the ordinate). The Nash equilibria are where the players' correspondences agree, i.e., cross. These are shown with points in the right hand graph. The best response mappings agree (i.e., cross)
Folkman graph the Folkman graph is formula_1. Folkman graph In the mathematical field of graph theory, the Folkman graph, named after Jon Folkman, is a bipartite 4-regular graph with 20 vertices and 40 edges. The Folkman graph is Hamiltonian and has chromatic number 2, chromatic index 4, radius 3, diameter 4 and girth 4. It is also a 4-vertex-connected and 4-edge-connected perfect graph. It has book thickness 3 and queue number 2. The automorphism group of the Folkman graph acts transitively on its edges but not on its vertices. It is the smallest undirected graph that is edge-transitive and regular, but not