Interval minors of complete bipartite graphs
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 Kr,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 K3,s-interval minor free graphs is studied.
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.