Bojan Mohar, Arash Rafiey, Behruz Tayfeh-Rezaie, Hehui Wu
Published 2014-08-06Version 1
Interval minors of bipartite graphs were recently introduced by Jacob Fox in the study of Stanley-Wilf limits. We investigate the maximum number of edges in $K_{r,s}$-interval minor free bipartite graphs. We determine exact values when $r=2$ and describe the extremal graphs. For $r=3$, lower and upper bounds are given and the structure of $K_{3,s}$-interval minor free graphs is studied.
On the Orchard crossing number of complete bipartite graphs
On anti-Ramsey numbers for complete bipartite graphs and the Turan function
Book drawings of complete bipartite graphs
![QR code for arXiv:1408.1155 [math.CO]](http://oss.arxitics.com/images/favicon.svg)