2 papers
math.MG2018
Splitting loops and necklaces: Variants of the square peg problem
Jai Aslam, Shujian Chen, Florian Frick +3
Toeplitz conjectured that any simple planar loop inscribes a square. Here we prove variants of Toeplitz' square peg problem. We prove Hadwiger's 1971 conjecture that any simple loo…
math.CO2017
On the generalized Erdős--Kneser conjecture: proofs and reductions
Jai Aslam, Shuli Chen, Ethan Coldren +2
Alon, Frankl, and Lovász proved a conjecture of Erdős that one needs at least colors to color the -subsets of such that an…