Abstract
The local boxicity of a graph G, denoted by lbox(G), is the minimum positive integer l such that G can be obtained using the intersection of k (where k≥l) interval graphs where each vertex of G appears as a non-universal vertex in at most l of these interval graphs. Let G be a graph on n vertices having m edges. Let Δ denote the maximum degree of a vertex in G. We show that,•lbox(G)≤213log⁎ΔΔ.•lbox(G)∈O(nlogn).•lbox(G)≤(213log⁎m+2)m.•the local boxicity of G is at most its product dimension. This connection helps us in showing that the local boxicity of the Kneser graphK(n,k) is at most k2loglogn. The above results can be extended to the local dimension of a partially ordered set due to the known connection between local boxicity and local dimension. Using this connection along with known results it can be shown that there exist graphs of maximum degree Δ having a local boxicity of Ω(ΔlogΔ). There also exist graphs on n vertices and graphs on m edges having local boxicity of Ω(nlogn) and Ω(mlogm), respectively.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.