GLn/P General linear group GL(n, p ) Binomial theorem Newton Binomial Formulas in Schubert Calculus Jorge C ORDOVEZ , Letterio G ATTO , and Ta ́ ıse S ANTIAGO Clique (graph theory) Clique game (Redirected from Ramsey game ) In game theory , a Markov strategy is one that depends only on state variables that summarize the history of the game in one way or another. [1] For instance, a state variable can be the current play in a repeated game, or it can be any interpretation of a recent sequence of play. A profile of Markov strategies is a Markov perfect equilibrium if it is a Nash equilibrium in every state of the game. Quantum Markov chain Theorem on friends and strangers Friends and Strangers Theorem - Numberphile Ramsey's theorem In combinatorial mathematics , Ramsey's theorem , in one of its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling (with colours) of a sufficiently large complete graph . To