RUS  ENG
Full version
JOURNALS // Teoriya Veroyatnostei i ee Primeneniya // Archive

Teor. Veroyatnost. i Primenen., 2003 Volume 48, Issue 2, Pages 411–416 (Mi tvp295)

This article is cited 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

DOI: 10.4213/tvp295


 English version:
Theory of Probability and its Applications, 2004, 48:2, 368–372

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024