Independence number of intersection graphs of axis-parallel segments

05/30/2022
by   Marco Caoduro, et al.
0

We prove that for any triangle-free intersection graph of n axis-parallel segments in the plane, the independence number α of this graph is at least α≥ n/4 + Ω(√(n)). We complement this with a construction of a graph in this class satisfying α≤ n/4 + c √(n) for an absolute constant c, which demonstrates the optimality of our result.

READ FULL TEXT

page 2

page 3

page 4

page 5

page 6

page 7

page 9

research
04/14/2021

Burling graphs revisited – Part 1 New characterizations

The Burling sequence is a sequence of triangle-free graphs of increasing...
research
10/18/2022

Intersection of triangles in space based on cutting off segment

The article proposes a new method for finding the triangle-triangle inte...
research
09/14/2018

Dushnik-Miller dimension of d-dimensional tilings with boxes

Planar graphs are the graphs with Dushnik-Miller dimension at most three...
research
02/04/2021

Parallel Independence in Attributed Graph Rewriting

In order to define graph transformations by the simultaneous application...
research
01/10/2023

Contact graphs of boxes with unidirectional contacts

This paper is devoted to the study of particular classes of geometricall...
research
03/28/2023

Constant-Hop Spanners for More Geometric Intersection Graphs, with Even Smaller Size

In SoCG 2022, Conroy and Tóth presented several constructions of sparse,...
research
06/04/2018

Strong Pseudo Transitivity and Intersection Graphs

A directed graph G=(V,E) is strongly pseudo transitive if there is a pa...

Please sign up or login with your details

Forgot password? Click here to reset