One Probabilistic equivalent of the four color conjecture
    
    
  
  
  
      
      
      
        
Teoriâ veroâtnostej i ee primeneniâ, Tome 48 (2003) no. 2, pp. 411-416
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			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.
			
            
            
            
          
        
      
                  
                    
                    
                    
                    
                    
                      
Mots-clés : 
four color conjecture.
                    
                  
                
                
                @article{TVP_2003_48_2_a13,
     author = {Yu. V. Matiyasevich},
     title = {One {Probabilistic} equivalent of the four color conjecture},
     journal = {Teori\^a vero\^atnostej i ee primeneni\^a},
     pages = {411--416},
     publisher = {mathdoc},
     volume = {48},
     number = {2},
     year = {2003},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TVP_2003_48_2_a13/}
}
                      
                      
                    Yu. V. Matiyasevich. One Probabilistic equivalent of the four color conjecture. Teoriâ veroâtnostej i ee primeneniâ, Tome 48 (2003) no. 2, pp. 411-416. http://geodesic.mathdoc.fr/item/TVP_2003_48_2_a13/
