Note on upper bound graphs and forbidden subposets

In the upper bound graph of a poset P , the vertex set is V ( P ) and x y is an edge if there exists an m ∈ V ( P ) with x , y ≤ P m . We show some characterizations on split upper bound graphs, threshold upper bound graphs and difference upper bound graphs in terms of m -subposets and canonical posets.