Cutsets in Infinite Graphs. - Ádám Timár (Comb. Probab. Comput., 2007)

Split Hypergraphs. - Ádám Timár (SIAM J. Discret. Math., 2008)

Approximating Cayley Diagrams Versus Cayley Graphs. - Ádám Timár (Comb. Probab. Comput., 2012)

A Factor Matching of Optimal Tail Between Poisson Processes. - Ádám Timár (Comb., 2023)

Unimodular random one-ended planar graphs are sofic. - Ádám Timár (Comb. Probab. Comput., 2023)

A full characterization of invariant embeddability of unimodular planar graphs. - Ádám Timár; László Márton Tóth (Random Struct. Algorithms, 2024)