arXiv Analytics

Sign in

arXiv:1508.01263 [math.CO]AbstractReferencesReviewsResources

Interval minors of complete multipartite graphs

Yaping Mao, Hongjian Lai, Zhao Wang, Zhiwei Guo

Published 2015-08-06Version 1

Interval minors of bipartite graphs were introduced by Jacob Fox in the study of Stanley-Wilf limits. Recently, Mohar, Rafiey, Tayfeh-Rezaie and Wu investigated the maximum number of edges in $K_{k,\ell}$-interval minor free bipartite graphs when $k=2$ and $\ell=3$. In this paper, we investigate the maximum number of edges in $K_{k,\ell}$-interval minor free bipartite graphs for general $k$ and $\ell$. We also study the maximum number of edges in $K_{\ell_1,\ell_2,\cdots,\ell_t}$-interval minor free multipartite graphs.

Comments: 9 pages. arXiv admin note: text overlap with arXiv:1408.1155 by other authors
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1102.5361 [math.CO] (Published 2011-02-25)
Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products
arXiv:1508.04201 [math.CO] (Published 2015-08-18)
Equitable colorings of complete multipartite graphs
arXiv:math/0601767 [math.CO] (Published 2006-01-31)
Empty Rectangles and Graph Dimension