Interval minors of complete multipartite graphs

Abstract

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,·s,t-interval minor free multipartite graphs.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…