47 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. Analyticity Results in Bernoulli Percolation.
10. Hyperbolicity vs. Amenability for Planar Graphs
11. On graph-like continua of finite length
12. Characterising planar Cayley graphs and Cayley complexes in terms of group presentations
13. The boundary of a square tiling of a graph coincides with the Poisson boundary
14. 2‐complexes with unique embeddings in 3‐space.
15. Cycle decompositions: From graphs to continua
16. LAMPLIGHTER GRAPHS DO NOT ADMIT HARMONIC FUNCTIONS OF FINITE ENERGY
17. The Max-Flow Min-Cut theorem for countable networks
18. Graph topologies induced by edge lengths
19. Perfect matchings in [formula omitted]-partite [formula omitted]-graphs
20. On fixing boundary points of transitive hyperbolic graphs
21. An Eberhard-Like Theorem for Pentagons and Heptagons
22. Every rayless graph has an unfriendly partition
23. Spanning surfaces in 3-graphs.
24. The power of two choices for random walks.
25. Every planar graph with the Liouville property is amenable.
26. On planar Cayley graphs and Kleinian groups.
27. Percolation on an infinitely generated group.
28. Subcritical Graph Classes Containing All Planar Graphs.
29. The Bradley–Terry condition is [formula omitted]-testable.
30. The Planar Cubic Cayley Graphs.
31. CHAPTER 2: The finite and 1-ended cubic planar Cayley graphs.
32. CHAPTER 3: The planar multi-ended Cayley graphs with 2 generators.
33. CHAPTER 1: Introductory material and basic facts.
34. CHAPTER 4: The planar multi-ended Cayley graphs generated by 3 involutions.
35. Hitting Times, Cover Cost, and the Wiener Index of a Tree.
36. Every rayless graph has an unfriendly partition
37. A short proof of Fleischner’s theorem
38. Graphs of finite measure.
39. New Bounds for Edge-Cover by Random Walk.
40. Two-Color Babylon.
41. Bases and closures under infinite sums
42. Uniqueness of electrical currents in a network of finite total resistance.
43. Infinite Hamilton cycles in squares of locally finite graphs
44. Invariant spanning double rays in amenable groups.
45. Bibliography.
46. CHAPTER 5: Outlook.
47. Acknowledgements.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.