2015/08/06 by Yaping Mao, Hongjian Lai, Hong-Jian Lai +6 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory #math.CO
paper · pdf · doi:10.48550/arxiv.1508.01263
9 pages. arXiv admin note: text overlap with arXiv:1408.1155 by other authors
openalex publication_date 2015/08/06 · arxiv created 2015/09/05 · arxiv updated 2015/09/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 Kk,ℓ-interval minor free bipartite graphs when k=2 and k=3. In this paper, we investigate the maximum number of edges in Kk,ℓ-interval minor free bipartite graphs for general k and ℓ. We also study the maximum number of edges in Kℓ1,ℓ2,⋯,ℓt-interval minor free multipartite graphs.