Abstract
A box is the cartesian product of real intervals, which are either bounded or equal to R. A box is said to be d-local if at most d of the intervals are bounded. In this paper, we investigate the recently introduced local boxicity of a graph G, which is the minimum d such that G can be represented as the intersection of d-local boxes in some dimension. We prove that all graphs of maximum degree Δ have local boxicity O(Δ), while almost all graphs of maximum degree Δ have local boxicity Ω(Δ), improving known upper and lower bounds. We also give improved bounds on the local boxicity as a function of the number of edges or the genus. Finally, we investigate local boxicity through the lens of chromatic graph theory. We prove that the family of graphs of local boxicity at most 2 is χ-bounded, which means that the chromatic number of the graphs in this class can be bounded by a function of their clique number. This extends a classical result on graphs of boxicity at most 2.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
