91 results on '"Georgakopoulos, Agelos"'
Search Results
2. Presentations for vertex-transitive graphs
3. The Planar Cayley Graphs are Effectively Enumerable I: Consistently Planar Graphs
4. Forcing large tight components in 3-graphs
5. ON PARTICLES IN EQUILIBRIUM ON THE REAL LINE
6. The planar cubic Cayley graphs of connectivity 2
7. On covers of graphs by Cayley graphs
8. On the exponential growth rates of lattice animals and interfaces.
9. Graph minors and metric spaces
10. A study of 2-ended graphs via harmonic functions
11. Analyticity Results in Bernoulli Percolation.
12. Hyperbolicity vs. Amenability for Planar Graphs
13. Every countable compact subset of $\mathbb{S}^n$ is tame
14. On graph-like continua of finite length
15. Characterising planar Cayley graphs and Cayley complexes in terms of group presentations
16. The boundary of a square tiling of a graph coincides with the Poisson boundary
17. 2‐complexes with unique embeddings in 3‐space.
18. Cycle decompositions: From graphs to continua
19. LAMPLIGHTER GRAPHS DO NOT ADMIT HARMONIC FUNCTIONS OF FINITE ENERGY
20. The Max-Flow Min-Cut theorem for countable networks
21. Graph topologies induced by edge lengths
22. Perfect matchings in [formula omitted]-partite [formula omitted]-graphs
23. On fixing boundary points of transitive hyperbolic graphs
24. An Eberhard-Like Theorem for Pentagons and Heptagons
25. Every rayless graph has an unfriendly partition
26. Analyticity of the percolation density $\theta$ in all dimensions
27. Choice and Bias in Random Walks
28. Spanning surfaces in 3-graphs.
29. The power of two choices for random walks.
30. On the exponential growth rates of lattice animals and interfaces
31. Analyticity results in Bernoulli Percolation
32. Every planar graph with the Liouville property is amenable.
33. On planar Cayley graphs and Kleinian groups.
34. Percolation on an infinitely generated group.
35. Limits of subcritical random graphs and random graphs with excluded minors
36. Subcritical Graph Classes Containing All Planar Graphs.
37. The Poisson boundary of planar graphs via discrete Riemann maps
38. The Bradley–Terry condition is [formula omitted]-testable.
39. The Planar Cubic Cayley Graphs.
40. CHAPTER 2: The finite and 1-ended cubic planar Cayley graphs.
41. CHAPTER 3: The planar multi-ended Cayley graphs with 2 generators.
42. CHAPTER 1: Introductory material and basic facts.
43. CHAPTER 4: The planar multi-ended Cayley graphs generated by 3 involutions.
44. On 3-coloured tournaments
45. Hitting Times, Cover Cost, and the Wiener Index of a Tree.
46. Every rayless graph has an unfriendly partition
47. A short proof of Fleischner’s theorem
48. Graphs of finite measure.
49. New Bounds for Edge-Cover by Random Walk.
50. Two-Color Babylon.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.