1 citations · 2 across the 5 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018
Fair splittings by independent sets in sparse graphs
Alexander Black, Umur Cetin, Florian Frick +2
Given a partition of the vertex set of a graph, we are interested in finding multiple disjoint independent sets that contain the correct fr…
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…