Boxicity and topological invariants

From MaRDI portal
Publication:499501

DOI10.1016/J.EJC.2015.07.020zbMATH Open1321.05283arXiv1503.05765OpenAlexW1869975288MaRDI QIDQ499501FDOQ499501


Authors: L. Esperet Edit this on Wikidata


Publication date: 30 September 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: The boxicity of a graph G=(V,E) is the smallest integer k for which there exist k interval graphs Gi=(V,Ei), 1leilek, such that E=E1capcdotscapEk. In the first part of this note, we prove that every graph on m edges has boxicity O(sqrtmlogm), which is asymptotically best possible. We use this result to study the connection between the boxicity of graphs and their Colin de Verdi`ere invariant, which share many similarities. Known results concerning the two parameters suggest that for any graph G, the boxicity of G is at most the Colin de Verdi`ere invariant of G, denoted by mu(G). We observe that every graph G has boxicity O(mu(G)4(logmu(G))2), while there are graphs G with boxicity Omega(mu(G)sqrtlogmu(G)). In the second part of this note, we focus on graphs embeddable on a surface of Euler genus g. We prove that these graphs have boxicity O(sqrtglogg), while some of these graphs have boxicity Omega(sqrtglogg). This improves the previously best known upper and lower bounds. These results directly imply a nearly optimal bound on the dimension of the adjacency poset of graphs on surfaces.


Full work available at URL: https://arxiv.org/abs/1503.05765




Recommendations




Cites Work


Cited In (12)





This page was built for publication: Boxicity and topological invariants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499501)