Counterexamples in percolation: the site percolation critical probabilities p<sub>H</sub>and p<sub>T</sub>are unequal for a class of fully triangulated graphs (Q3317876)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Counterexamples in percolation: the site percolation critical probabilities pHand pTare unequal for a class of fully triangulated graphs |
scientific article; zbMATH DE number 3848384
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counterexamples in percolation: the site percolation critical probabilities p<sub>H</sub>and p<sub>T</sub>are unequal for a class of fully triangulated graphs |
scientific article; zbMATH DE number 3848384 |
Statements
Counterexamples in percolation: the site percolation critical probabilities p<sub>H</sub>and p<sub>T</sub>are unequal for a class of fully triangulated graphs (English)
0 references
1984
0 references
critical probability
0 references
site percolation
0 references
self-matching graph
0 references
0.7984371781349182
0 references
0.7720929980278015
0 references
0.7711206078529358
0 references
