Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count
share
We show that triangle-free penny graphs have degeneracy at most two, list coloring number (choosability) at most three, diameter D=Ω(√(n)), and at most (2n-Ω(√(n)),2n-D-2) edges.
READ FULL TEXT