Interval minors of complete bipartite graphs
Combinatorics
2014-08-07 v1 Discrete Mathematics
Abstract
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 -interval minor free bipartite graphs. We determine exact values when and describe the extremal graphs. For , lower and upper bounds are given and the structure of -interval minor free graphs is studied.
Keywords
Cite
@article{arxiv.1408.1155,
title = {Interval minors of complete bipartite graphs},
author = {Bojan Mohar and Arash Rafiey and Behruz Tayfeh-Rezaie and Hehui Wu},
journal= {arXiv preprint arXiv:1408.1155},
year = {2014}
}