A graph with the partial order competition dimension greater than five

In this paper, we use the Erdos-Szekeres lemma to show that there exists a graph with partial order competition dimension greater than five.

[1]  Jung Yeun Lee,et al.  On the competition graphs of d-partial orders , 2016, Discret. Appl. Math..

[2]  Boram Park,et al.  The niche graphs of doubly partial orders , 2009 .

[3]  G. E. Hutchinson,et al.  Limnological Studies in Connecticut. VII. A Critical Examination of the Supposed Relationship between Phytoplakton Periodicity and Chemical Changes in Lake Waters , 1944 .

[4]  F. Roberts.  Graph Theory and Its Applications to Problems of Society , 1987 .

[5]  Boram Park,et al.  The Phylogeny Graphs of Doubly Partial Orders , 2013, Discuss. Math. Graph Theory.

[6]  Han Hyuk Cho,et al.  A class of acyclic digraphs with interval competition graphs , 2005, Discret. Appl. Math..

[7]  Jihoon Choi,et al.  The partial order competition dimensions of bipartite graphs , 2019, Discret. Appl. Math..

[8]  G. Szekeres,et al.  A combinatorial problem in geometry , 2009 .

[9]  Boram Park,et al.  The m-step competition graphs of doubly partial orders , 2011, Appl. Math. Lett..

[10]  Junjie Lu,et al.  Dimension-2 poset competition numbers and dimension-2 poset double competition numbers , 2010, Discret. Appl. Math..

[11]  Junjie Lu,et al.  Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two , 2009, Appl. Math. Lett..

[12]  Jung Yeun Lee,et al.  On the partial order competition dimensions of chordal graphs , 2017, Discret. Appl. Math..

[13]  Boram Park,et al.  The competition hypergraphs of doubly partial orders , 2014, Discret. Appl. Math..