Qinru Shi

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper is mainly concerned with the upper and lower bound of the number of edges an ordered graph can have avoiding a fixed forbidden ordered subgraph H. The only case where a sharp bound has not been discovered is when H has interval chromatic number 2, where H can be represented as a 0-1 matrix P. Let ex < (n, n, P) be the maximum weight of an n by n(More)
  • 1