Boxicity, Poset Dimension, and Excluded Minors

@article{Esperet2018BoxicityPD,
  title={Boxicity, Poset Dimension, and Excluded Minors},
  author={Louis Esperet and Veit Wiechert},
  journal={Electron. J. Comb.},
  year={2018},
  volume={25},
  pages={4}
}
In this short note, we relate the boxicity of graphs (and the dimension of posets) with their generalized coloring parameters. In particular, together with known estimates, our results imply that any graph with no $K_t$-minor can be represented as the intersection of $O(t^2\log t)$ interval graphs (improving the previous bound of $O(t^4)$), and as the intersection of $\tfrac{15}2 t^2$ circular-arc graphs. 

Figures from this paper

Local Boxicity, Local Dimension, and Maximum Degree

An `almost linear' upper bound is given for both the parameters in terms of the maximum degree of a graph, namely `local boxicity' and `local dimension', and two other upper bounds for the local boxicity are proved.

Better bounds for poset dimension and boxicity

  • A. ScottD. Wood
  • Mathematics, Computer Science
    Transactions of the American Mathematical Society
  • 2019
It is proved that the dimension of every poset whose comparability graph has maximum degree $\Delta$ is at most $\Delta\log^{1+o(1)} \Delta$, and is within a $\log^{o( 1)}\Delta$ factor of optimal.

Shallow Minors, Graph Products and Beyond Planar Graphs

The planar graph product structure theorem of Dujmović, Joret, Micek, Morin, Ueckerdt, and Wood [J. ACM 2020] states that every planar graph is a subgraph of the strong product of a graph with

Odd colourings, conflict-free colourings and strong colouring numbers

The odd chromatic number and the conflict-free chromatic number are new graph parameters introduced by Petruševski and Škrekovski [2021] and Fabrici, Lužar, Rindošová and Soták [2022] respectively.

Bounding threshold dimension: realizing graphic Boolean functions as the AND of majority functions

A graph G on n vertices is a threshold graph if there exist real numbers a1, a2, . . . , an and b such that the zero-one solutions of the linear inequality n ∑ i=1 aixi ≤ b are the characteristic

Bounding Threshold Dimension: Realizing Graphic Boolean Functions as the AND of Majority Gates

A graph G on n vertices is a threshold graph if there exist real numbers a1, a2, . . . , an and b such that the zero-one solutions of the linear inequality n ∑ i=1 aixi ≤ b are the characteristic

References

SHOWING 1-10 OF 31 REFERENCES

Colorings and Homomorphisms of Minor Closed Classes

We relate acyclic (and star) chromatic number of a graph to the chromatic number of its minors and as a consequence we show that the set of all triangle free planar graphs is homomorphism bounded by

Boxicity of Graphs on Surfaces

The boxicity of a graph G = (V, E) is the least integer k for which there exist k interval graphs Gi = (V, Ei), 1 ≤ i ≤ k, such that \documentclass[12pt]{minimal} \usepackage{amsmath}

Better bounds for poset dimension and boxicity

  • A. ScottD. Wood
  • Mathematics, Computer Science
    Transactions of the American Mathematical Society
  • 2019
It is proved that the dimension of every poset whose comparability graph has maximum degree $\Delta$ is at most $\Delta\log^{1+o(1)} \Delta$, and is within a $\log^{o( 1)}\Delta$ factor of optimal.

Interval representations of planar graphs

Boxicity and topological invariants

Nowhere Dense Graph Classes and Dimension

This paper establishes a new characterization of nowhere dense classes, in terms of poset dimension: a monotone graph class is nowhere dense if and only if for every h⩾1 and every ε > 0, posets of height at most h with n elements and whose cover graphs are in the class have dimension O(nϵ).

Dimension, Graph and Hypergraph Coloring

A new proof of the fact that the dimension of P is 2 if and only if GP is bipartite is given and it is shown that for each t ≥ 2, there exists a poset Pt for which the chromatic number of the graph of incomparable pairs of Pt is at most 3 t − 4, but the dimension is at least (3 / 2)t − 1.

Boxicity and Poset Dimension

The upper bound dim(P) ≤ 2box(GP) allows us to derive hitherto unknown upper bounds for poset dimension, and disproves a conjecture that the boxicity of a graph is O(Δ).