On-Hei Solomon Lo
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
On-Hei Solomon Lo has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Carol T. Zamfirescu
Department of Mathematics Computer Science and Statistics Ghent University 9000 Ghent Belgium
5 shared publications Jens M. Schmidt
3 shared publications- Ben Seamone
Mathematics Department Dawson College Montreal QC Canada
2 shared publications - Jan Goedgebeur
KU Leuven Kulak
2 shared publications - Jorik Jooken
KU Leuven
2 shared publications - Ben Seamone1 shared publication
Latest Publications
- 14 May 2026
- Published by Walter de Gruyter GmbH in Journal für die reine und angewandte Mathematik (Crelles Journal)
Period matrices and homological quasi-trees on discrete Riemann surfaces
We study discrete period matrices associated with graphs cellularly embedded on closed surfaces, resembling classical period matrices of Riemann surfaces. Defined via integrals of discrete harmonic 1-forms, these period matrices are known to encode discrete conformal structure in the sense of circle patterns. We obtain a combinatorial interpretation of the discrete period matrix, where its minors are expressed as weighted sums over certain spanning subgraphs, which we call homological quasi-trees. Furthermore, we relate the period matrix to the determinant of the Laplacian for a flat complex line bundle. We derive a combinatorial analogue of the Weil–Petersson potential on the Teichmüller space, expressed as a weighted sum over homological quasi-trees. Finally, we study the collection of homological quasi-trees from a (delta-)matroidal perspective. The discrete period matrix plays a role similar to that of the response matrix in circular planar networks, thereby addressing a question posed by Richard Kenyon.
- 14 May 2026
- Published by Walter de Gruyter GmbH in Journal für die reine und angewandte Mathematik (Crelles Journal)
Period matrices and homological quasi-trees on discrete Riemann surfaces
We study discrete period matrices associated with graphs cellularly embedded on closed surfaces, resembling classical period matrices of Riemann surfaces. Defined via integrals of discrete harmonic 1-forms, these period matrices are known to encode discrete conformal structure in the sense of circle patterns. We obtain a combinatorial interpretation of the discrete period matrix, where its minors are expressed as weighted sums over certain spanning subgraphs, which we call homological quasi-trees. Furthermore, we relate the period matrix to the determinant of the Laplacian for a flat complex line bundle. We derive a combinatorial analogue of the Weil–Petersson potential on the Teichmüller space, expressed as a weighted sum over homological quasi-trees. Finally, we study the collection of homological quasi-trees from a (delta-)matroidal perspective. The discrete period matrix plays a role similar to that of the response matrix in circular planar networks, thereby addressing a question posed by Richard Kenyon.
- 5 November 2024
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 170, 335-351
Counting cycles in planar triangulations
- 5 November 2024
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 170, 335-351
Counting cycles in planar triangulations
- 21 July 2024
- Published by Wiley in Journal of Graph Theory
- Vol. 107 (4) , 702-728
Cycles in 3‐connected claw‐free planar graphs and 4‐connected planar graphs without 4‐cycles
The cycle spectrum of a graph is the set of the cycle lengths in . Let be a graph class. For any integer , define to be the least integer such that for any with circumference at least . Denote by , and the classes of 3‐connected planar graphs, 3‐connected cubic planar graphs, 3‐connected claw‐free planar graphs, and 3‐connected claw‐free cubic planar graphs, respectively. The values of and were known for all . In the first part of this article, we prove the claw‐free version of these results by giving the values of and for all . In the second part we study the cycle spectra of 4‐connected planar graphs without 4‐cycles. Bondy conjectured that every 4‐connected planar graph has all cycle lengths from 3 to except possibly one even length. The truth of this conjecture would imply that every 4‐connected planar graph without 4‐cycles has all cycle lengths other than 4. It was already known that . We prove that can be embedded in the plane such that for any has a ‐cycle and all vertices not in lie in the exterior of .
- 21 July 2024
- Published by Wiley in Journal of Graph Theory
- Vol. 107 (4) , 702-728
Cycles in 3‐connected claw‐free planar graphs and 4‐connected planar graphs without 4‐cycles
The cycle spectrum of a graph is the set of the cycle lengths in . Let be a graph class. For any integer , define to be the least integer such that for any with circumference at least . Denote by , and the classes of 3‐connected planar graphs, 3‐connected cubic planar graphs, 3‐connected claw‐free planar graphs, and 3‐connected claw‐free cubic planar graphs, respectively. The values of and were known for all . In the first part of this article, we prove the claw‐free version of these results by giving the values of and for all . In the second part we study the cycle spectra of 4‐connected planar graphs without 4‐cycles. Bondy conjectured that every 4‐connected planar graph has all cycle lengths from 3 to except possibly one even length. The truth of this conjecture would imply that every 4‐connected planar graph without 4‐cycles has all cycle lengths other than 4. It was already known that . We prove that can be embedded in the plane such that for any has a ‐cycle and all vertices not in lie in the exterior of .
- 21 July 2024
- Published by Wiley in Journal of Graph Theory
- Vol. 107 (4) , 729-741
Defective acyclic colorings of planar graphs
This paper studies two variants of defective acyclic coloring of planar graphs. For a graph and a coloring of , a 2‐colored cycle (2CC) transversal is a subset of that intersects every 2‐colored cycle. Let be a positive integer. We denote by the minimum integer such that has a proper ‐coloring which has a 2CC transversal of size , and by the minimum size of a subset of such that is acyclic ‐colorable. We prove that for any ‐vertex 3‐colorable planar graph and for any planar graph provided that . We show that these upper bounds are sharp: there are infinitely many planar graphs attaining these upper bounds. Moreover, the minimum 2CC transversal can be chosen in such a way that induces a forest. We also prove that for any planar graph and .
- 21 July 2024
- Published by Wiley in Journal of Graph Theory
- Vol. 107 (4) , 729-741
Defective acyclic colorings of planar graphs
This paper studies two variants of defective acyclic coloring of planar graphs. For a graph and a coloring of , a 2‐colored cycle (2CC) transversal is a subset of that intersects every 2‐colored cycle. Let be a positive integer. We denote by the minimum integer such that has a proper ‐coloring which has a 2CC transversal of size , and by the minimum size of a subset of such that is acyclic ‐colorable. We prove that for any ‐vertex 3‐colorable planar graph and for any planar graph provided that . We show that these upper bounds are sharp: there are infinitely many planar graphs attaining these upper bounds. Moreover, the minimum 2CC transversal can be chosen in such a way that induces a forest. We also prove that for any planar graph and .
- 2 February 2024
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 93 (350) , 3059-3082
Few hamiltonian cycles in graphs with one or two vertex degrees
Inspired by Sheehan’s conjecture that no 4 4 -regular graph contains exactly one hamiltonian cycle, we prove results on hamiltonian cycles in regular graphs and nearly regular graphs. We fully disprove a conjecture of Haythorpe on the minimum number of hamiltonian cycles in regular hamiltonian graphs, thereby extending a result of Zamfirescu, as well as correct and complement Haythorpe’s computational enumerative results from [Exp. Math. 27 (2018), no. 4, 426–430]. Thereafter, we use the Lovász Local Lemma to extend Thomassen’s independent dominating set method. This extension allows us to find a second hamiltonian cycle that inherits linearly many edges from the first hamiltonian cycle. Regarding the limitations of this method, we answer a question of Haxell, Seamone, and Verstraete, and settle the first open case of a problem of Thomassen by showing that for k ∈ { 5 , 6 } k \in \{5, 6\} there exist infinitely many k k -regular hamiltonian graphs having no independent dominating set with respect to a prescribed hamiltonian cycle. Motivated by an observation of Aldred and Thomassen, we prove that for every κ ∈ { 2 , 3 } \kappa \in \{ 2, 3 \} and any positive integer k k , there are infinitely many non-regular graphs of connectivity κ \kappa containing exactly one hamiltonian cycle and in which every vertex has degree 3 3 or 2 k 2k .
- 2 February 2024
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 93 (350) , 3059-3082
Few hamiltonian cycles in graphs with one or two vertex degrees
Inspired by Sheehan’s conjecture that no 4 4 -regular graph contains exactly one hamiltonian cycle, we prove results on hamiltonian cycles in regular graphs and nearly regular graphs. We fully disprove a conjecture of Haythorpe on the minimum number of hamiltonian cycles in regular hamiltonian graphs, thereby extending a result of Zamfirescu, as well as correct and complement Haythorpe’s computational enumerative results from [Exp. Math. 27 (2018), no. 4, 426–430]. Thereafter, we use the Lovász Local Lemma to extend Thomassen’s independent dominating set method. This extension allows us to find a second hamiltonian cycle that inherits linearly many edges from the first hamiltonian cycle. Regarding the limitations of this method, we answer a question of Haxell, Seamone, and Verstraete, and settle the first open case of a problem of Thomassen by showing that for k ∈ { 5 , 6 } k \in \{5, 6\} there exist infinitely many k k -regular hamiltonian graphs having no independent dominating set with respect to a prescribed hamiltonian cycle. Motivated by an observation of Aldred and Thomassen, we prove that for every κ ∈ { 2 , 3 } \kappa \in \{ 2, 3 \} and any positive integer k k , there are infinitely many non-regular graphs of connectivity κ \kappa containing exactly one hamiltonian cycle and in which every vertex has degree 3 3 or 2 k 2k .
- 20 November 2023
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 165, 47-67
Generalized cut trees for edge-connectivity
- 20 November 2023
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 165, 47-67
Generalized cut trees for edge-connectivity
- Open Access
Few hamiltonian cycles in graphs with one or two vertex degrees
We fully disprove a conjecture of Haythorpe on the minimum number of hamiltonian cycles in regular hamiltonian graphs, thereby extending a result of Zamfirescu, as well as correct and complement Haythorpe's computational enumerative results from [Experim. Math. 27 (2018) 426-430]. Thereafter, we use the Lov\'asz Local Lemma to extend Thomassen's independent dominating set method. Regarding the limitations of this method, we answer a question of Haxell, Seamone, and Verstraete, and settle the first open case of a problem of Thomassen. Motivated by an observation of Aldred and Thomassen, we prove that for every $\kappa \in \{ 2, 3 \}$ and any positive integer $k$, there are infinitely many non-regular graphs of connectivity $\kappa$ containing exactly one hamiltonian cycle and in which every vertex has degree $3$ or $2k$.Open AccessFew hamiltonian cycles in graphs with one or two vertex degrees
We fully disprove a conjecture of Haythorpe on the minimum number of hamiltonian cycles in regular hamiltonian graphs, thereby extending a result of Zamfirescu, as well as correct and complement Haythorpe's computational enumerative results from [Experim. Math. 27 (2018) 426-430]. Thereafter, we use the Lov\'asz Local Lemma to extend Thomassen's independent dominating set method. Regarding the limitations of this method, we answer a question of Haxell, Seamone, and Verstraete, and settle the first open case of a problem of Thomassen. Motivated by an observation of Aldred and Thomassen, we prove that for every $\kappa \in \{ 2, 3 \}$ and any positive integer $k$, there are infinitely many non-regular graphs of connectivity $\kappa$ containing exactly one hamiltonian cycle and in which every vertex has degree $3$ or $2k$. - Open Access
- 6 October 2022
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 29 (4) , P4.18
On the Hamiltonian Property Hierarchy of 3-Connected Planar Graphs
The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph $K_2$. The graph $G$ is prism-hamiltonian if the prism over $G$ has a Hamilton cycle. A good even cactus is a connected graph in which every block is either an edge or an even cycle and every vertex is contained in at most two blocks. It is known that good even cacti are prism-hamiltonian. Indeed, showing the existence of a spanning good even cactus has become the most common technique in proving prism-hamiltonicity. Špacapan [S. Špacapan. A counterexample to prism-hamiltonicity of 3-connected planar graphs. J. Combin. Theory Ser. B, 146:364--371, 2021] asked whether having a spanning good even cactus is equivalent to having a hamiltonian prism for 3-connected planar graphs. In this article we answer his question in the negative, by showing that there are infinitely many 3-connected planar prism-hamiltonian graphs that have no spanning good even cactus. In addition, we prove the existence of an infinite class of 3-connected planar graphs that have a spanning good even cactus but no spanning good even cactus with maximum degree three.- 6 October 2022
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 29 (4) , P4.18
Open AccessOn the Hamiltonian Property Hierarchy of 3-Connected Planar Graphs
The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph $K_2$. The graph $G$ is prism-hamiltonian if the prism over $G$ has a Hamilton cycle. A good even cactus is a connected graph in which every block is either an edge or an even cycle and every vertex is contained in at most two blocks. It is known that good even cacti are prism-hamiltonian. Indeed, showing the existence of a spanning good even cactus has become the most common technique in proving prism-hamiltonicity. Špacapan [S. Špacapan. A counterexample to prism-hamiltonicity of 3-connected planar graphs. J. Combin. Theory Ser. B, 146:364--371, 2021] asked whether having a spanning good even cactus is equivalent to having a hamiltonian prism for 3-connected planar graphs. In this article we answer his question in the negative, by showing that there are infinitely many 3-connected planar prism-hamiltonian graphs that have no spanning good even cactus. In addition, we prove the existence of an infinite class of 3-connected planar graphs that have a spanning good even cactus but no spanning good even cactus with maximum degree three. - 30 September 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 346 (1)
Tight cycle spectrum gaps of cubic 3-connected toroidal graphs
- 30 September 2022
- Published by Elsevier in Discrete Mathematics
- Vol. 346 (1)
Tight cycle spectrum gaps of cubic 3-connected toroidal graphs
- 30 June 2022
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 36 (2) , 1496-1501
Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators
Whitney proved in 1931 that every 4-connected planar triangulation is hamiltonian. Later, Hakimi, Schmeichel, and Thomassen in 1979 conjectured that every such triangulation on $n$ vertices has at ...- 30 June 2022
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 36 (2) , 1496-1501
Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators
Whitney proved in 1931 that every 4-connected planar triangulation is hamiltonian. Later, Hakimi, Schmeichel, and Thomassen in 1979 conjectured that every such triangulation on $n$ vertices has at ...