Percolation of arbitrary words on the close-packed graph of .
Kesten, H., Sidoravicius, V., Zhang, Y. (2001)
Electronic Journal of Probability [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Almost all words are seen in critical site percolation on the triangular lattice.”
Percolation of arbitrary words on the close-packed graph of .
On a problem of Marco Buratti.
Horak, Peter, Rosa, Alexander (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Exchange symmetries in Motzkin path and bargraph models of copolymer adsorption.
van Rensburg, E.J.Janse, Rechnitzer, A. (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Diameter in path graphs.
Belan, A., Jurica, P. (1999)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
On quasistars in -cubes
Ladislav Nebeský (1984)
Časopis pro pěstování matematiky
Similarity:
A large dihedral symmetry of the set of alternating sign matrices.
Wieland, Benjamin (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Counting lattice paths by Narayana polynomials.
Sulanke, Robert A. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Embedding -quasistars into -cubes
Ladislav Nebeský (1988)
Czechoslovak Mathematical Journal
Similarity: