Triangle-free geometric intersection graphs with no large independent sets
classification
🧮 math.CO
cs.CGcs.DMmath.MG
keywords
graphsindependentintersectiontriangle-freearbitrarilygeometriclargeline
read the original abstract
It is proved that there are triangle-free intersection graphs of line segments in the plane with arbitrarily small ratio between the maximum size of an independent set and the total number of vertices.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.