arXiv:2205.15189 [math.CO]AbstractReferencesReviewsResources
Independence number of intersection graphs of axis-parallel segments
Marco Caoduro, Jana Cslovjecsek, Michał Pilipczuk, Karol Węgrzycki
Published 2022-05-30Version 1
We prove that for any triangle-free intersection graph of $n$ axis-parallel segments in the plane, the independence number $\alpha$ of this graph is at least $\alpha \ge n/4 + \Omega(\sqrt{n})$. We complement this with a construction of a graph in this class satisfying $\alpha \le n/4 + c \sqrt{n}$ for an absolute constant $c$, which demonstrates the optimality of our result.
Comments: 10 pages and 3 figures
Related articles: Most relevant | Search more
arXiv:1304.2862 [math.CO] (Published 2013-04-10)
Complements of nearly perfect graphs
arXiv:2308.16647 [math.CO] (Published 2023-08-31)
On size Ramsey numbers for a pair of cycles
arXiv:1706.05423 [math.CO] (Published 2017-06-16)
Weighted counting of non-negative integer points in a subspace