Agelos Georgakopoulos
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Agelos Georgakopoulos has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Peter Winkler
Department of Mathematics, Dartmouth College, Hanover, NH 03755-3551, USA
3 shared publications - Bojan Mohar
Department of Mathematics Simon Fraser University Burnaby British Columbia Canada
2 shared publications - Henning Bruhn
Université Pierre et Marie Curie
2 shared publications - Matt DeVos
Simon Fraser University
2 shared publications - Philipp Sprüssel
Graz University of Technology
2 shared publications - Robert Šámal
Charles University
2 shared publications
Latest Publications
- Open Access
- 30 January 2012
- Published by Elsevier in Advances in Mathematics
- Vol. 229 (2) , 935-967
Cycle decompositions: From graphs to continua
- 30 January 2012
- Published by Elsevier in Advances in Mathematics
- Vol. 229 (2) , 935-967
Open AccessCycle decompositions: From graphs to continua
- 1 January 2012
- Published by Walter de Gruyter GmbH in Integers
- Vol. 12 (5)
Two-Color Babylon
: We solve the game of Babylon when played with chips of two colors, giving a winning strategy for the second player in all previously unsolved cases.
- 1 January 2012
- Published by Walter de Gruyter GmbH in Integers
- Vol. 12 (5)
Two-Color Babylon
: We solve the game of Babylon when played with chips of two colors, giving a winning strategy for the second player in all previously unsolved cases.
- Open Access
Two-Color Babylon
We solve the game of Babylon when played with chips of two colors, giving a winning strategy for the second player in all previously unsolved cases.
Open AccessTwo-Color Babylon
We solve the game of Babylon when played with chips of two colors, giving a winning strategy for the second player in all previously unsolved cases.
- Open Access
New Bounds for Edge-Cover by Random Walk
We show that the expected time for a random walk on a (multi-)graph $G$ to traverse all $m$ edges of $G$, and return to its starting point, is at most $2m^2$; if each edge must be traversed in both directions, the bound is $3m^2$. Both bounds are tight and may be applied to graphs with arbitrary edge lengths, with implications for Brownian motion on a finite or infinite network of total edge-length $m$.Open AccessNew Bounds for Edge-Cover by Random Walk
We show that the expected time for a random walk on a (multi-)graph $G$ to traverse all $m$ edges of $G$, and return to its starting point, is at most $2m^2$; if each edge must be traversed in both directions, the bound is $3m^2$. Both bounds are tight and may be applied to graphs with arbitrary edge lengths, with implications for Brownian motion on a finite or infinite network of total edge-length $m$. - 1 September 2010
- Published by Springer Nature in Combinatorica
- Vol. 30 (5) , 521-532
Every rayless graph has an unfriendly partition
- 1 September 2010
- Published by Springer Nature in Combinatorica
- Vol. 30 (5) , 521-532
Every rayless graph has an unfriendly partition
- 27 May 2010
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 44 (4) , 931-945
An Eberhard-Like Theorem for Pentagons and Heptagons
- 27 May 2010
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 44 (4) , 931-945
An Eberhard-Like Theorem for Pentagons and Heptagons
- Open Access
An Eberhard-like theorem for pentagons and heptagons
Eberhard proved that for every sequence $(p_k), 3\le k\le r, k\ne 5,7$ of non-negative integers satisfying Euler's formula $\sum_{k\ge3} (6-k) p_k = 12$, there are infinitely many values $p_6$ such that there exists a simple convex polyhedron having precisely $p_k$ faces of length $k$ for every $k\ge3$, where $p_k=0$ if $k>r$. In this paper we prove a similar statement when non-negative integers $p_k$ are given for $3\le k\le r$, except for $k=5$ and $k=7$. We prove that there are infinitely many values $p_5,p_7$ such that there exists a simple convex polyhedron having precisely $p_k$ faces of length $k$ for every $k\ge3$. %, where $p_k=0$ if $k>r$. We derive an extension to arbitrary closed surfaces, yielding maps of arbitrarily high face-width. Our proof suggests a general method for obtaining results of this kind.Open AccessAn Eberhard-like theorem for pentagons and heptagons
Eberhard proved that for every sequence $(p_k), 3\le k\le r, k\ne 5,7$ of non-negative integers satisfying Euler's formula $\sum_{k\ge3} (6-k) p_k = 12$, there are infinitely many values $p_6$ such that there exists a simple convex polyhedron having precisely $p_k$ faces of length $k$ for every $k\ge3$, where $p_k=0$ if $k>r$. In this paper we prove a similar statement when non-negative integers $p_k$ are given for $3\le k\le r$, except for $k=5$ and $k=7$. We prove that there are infinitely many values $p_5,p_7$ such that there exists a simple convex polyhedron having precisely $p_k$ faces of length $k$ for every $k\ge3$. %, where $p_k=0$ if $k>r$. We derive an extension to arbitrary closed surfaces, yielding maps of arbitrarily high face-width. Our proof suggests a general method for obtaining results of this kind. - 1 August 2009
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 34, 279-281
Every rayless graph has an unfriendly partition
- 1 August 2009
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 34, 279-281
Every rayless graph has an unfriendly partition