Showing 2021Show all
2 papers · 1 filter
math.CO2021
Three-chromatic geometric hypergraphs
Gábor Damásdi, Dömötör Pálvölgyi
We prove that for any planar convex body C there is a positive integer m with the property that any finite point set P in the plane can be three-colored such that there is no trans…
math.CO2021
Crumby colorings -- red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen
János Barát, Zoltán L. Blázsik, Gábor Damásdi
Thomassen formulated the following conjecture: Every -connected cubic graph has a red-blue vertex coloring such that the blue subgraph has maximum degree at most (that is, i…