activity
20072025
most citedMaximizing the number of q-colorings

28 citations · 125 across the 26 of their papers we have counts for

collaborators

39 papers

math.HO2025

A cute proof that makes natural

Po-Shen Loh

The number has rich connections throughout mathematics, and has the honor of being the base of the natural logarithm. However, most students finish secondary school (and even u…

cs.CY2020★ 5 cited

Flipping the Perspective in Contact Tracing

Po-Shen Loh

We introduce a fundamentally different paradigm for contact tracing: for each positive case, do not only ask direct contacts to quarantine; instead, tell everyone how many relation…

math.CO2020★ 3 cited

Large rainbow matchings in edge-colored graphs

Debsoumya Chakraborti, Po-Shen Loh

A subgraph of an edge-colored graph is called \emph{rainbow} if all of its edges have distinct colors. There has been much research on the topic of finding a large rainbow matching…

math.HO2019★ 14 cited

A Simple Proof of the Quadratic Formula

Po-Shen Loh

This article provides a simple proof of the quadratic formula, which also produces an efficient and natural method for solving general quadratic equations. The derivation is comput…

math.CO2019★ 5 cited

Extremal graphs with local covering conditions

Debsoumya Chakraborti, Po-Shen Loh

We systematically study a natural problem in extremal graph theory, to minimize the number of edges in a graph with a fixed number of vertices, subject to a certain local condition…

math.CO2019★ 9 cited

Minimizing the numbers of cliques and cycles of fixed size in an -saturated graph

Debsoumya Chakraborti, Po-Shen Loh

This paper considers two important questions in the well-studied theory of graphs that are -saturated. A graph is called -saturated if does not contain a subgraph iso…