Referenzen
9.
Antar Bandyopadhyay, Jeffrey Steif und �dám Timár
On the cluster size distribution for percolation on some general graphs
Rev. Mat. Iberoam., 26(2):529--550
2010
8.
�dám Timár
Split hypergraphs
SIAM J. Discrete Math., 22(3):1155--1163
2008
7.
�dám Timár
Cutsets in infinite graphs
Combin. Probab. Comput., 16(1):159--166
2007
6.
�dám Timár
Ends in free minimal spanning forests
Ann. Probab., 34(3):865--869
2006
5.
Adám Timár
Neighboring clusters in Bernoulli percolation
Ann. Probab., 34(6):2332--2343
2006
4.
�dám Timár
Percolation on nonunimodular transitive graphs
Ann. Probab., 34(6):2344--2364
2006
3.
Adam Timar
Group-invariant random processes
Herausgeber: ProQuest LLC, Ann Arbor, MI,
2006
ISBN: 978-0542-50472-3
2.
�dám Timár
Tree and grid factors for general point processes
Electron. Comm. Probab., 9:53--59
2004
1.
Yong-Gao Chen, Gábor Kun, Gábor Pete, Imre Z. Ruzsa und �dám Timár
Prime values of reducible polynomials. II
Acta Arith., 104(2):117--127
2002
Seite:  
Export als:
BibTeX, XML