Ádám Timár

According to our database, Ádám Timár authored at least 6 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2024

A full characterization of invariant embeddability of unimodular planar graphs.

Ádám Timár, László Márton Tóth

Random Struct. Algorithms, March, 2024

2023

Unimodular random one-ended planar graphs are sofic.

Ádám Timár

Comb. Probab. Comput., November, 2023

A Factor Matching of Optimal Tail Between Poisson Processes.

Ádám Timár

Comb., April, 2023

2012

Approximating Cayley Diagrams Versus Cayley Graphs.

Ádám Timár

Comb. Probab. Comput., 2012

2008

Split Hypergraphs.

Ádám Timár

SIAM J. Discret. Math., 2008

2007

Cutsets in Infinite Graphs.

Ádám Timár

Comb. Probab. Comput., 2007