|
This article is cited in 3 scientific papers (total in 3 papers)
Short Communications
One Probabilistic equivalent of the four color conjecture
Yu. V. Matiyasevich St. Petersburg Department of V. A. Steklov Institute of Mathematics, Russian Academy of Sciences
Abstract:
For every two-connected planar three-valent graph we introduce in a natural way a probabilistic space and define two random events. The four color conjecture turns out to be equivalent to (a positive) correlation of these events.
Keywords:
four color conjecture.
Received: 17.12.2002
Citation:
Yu. V. Matiyasevich, “One Probabilistic equivalent of the four color conjecture”, Teor. Veroyatnost. i Primenen., 48:2 (2003), 411–416; Theory Probab. Appl., 48:2 (2004), 368–372
Linking options:
https://www.mathnet.ru/eng/tvp295https://doi.org/10.4213/tvp295 https://www.mathnet.ru/eng/tvp/v48/i2/p411
|
Statistics & downloads: |
Abstract page: | 656 | Full-text PDF : | 234 | References: | 110 |
|