Deterministic Graph Games and a Probabilistic Intuition
Author:
- 1 March 1994
- journal article
- research article
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 3 (1) , 13-26
Abstract
There is a close relationship between biased graph games and random graph processes. In this paper, we develop the analogy and give further interesting instances.Keywords
This publication has 8 references indexed in Scilit:
- Expanding graphs contain all small treesCombinatorica, 1987
- The Ramsey number of a graph with bounded maximum degreeJournal of Combinatorial Theory, Series B, 1983
- Long paths in sparse random graphsCombinatorica, 1982
- Remarks on positional games. IActa Mathematica Hungarica, 1982
- Van der waerden and ramsey type gamesCombinatorica, 1981
- Biased Positional Games1978
- Hamiltonian circuits in random graphsDiscrete Mathematics, 1976
- On a combinatorial gameJournal of Combinatorial Theory, Series A, 1973