Odd complete bipartite minors in graphs with independence number two

Abstract

Recently, Chen and Deng have proved that every graph G with independence number two contains K,(G)- as a minor for each integer with 1≤ < (G). In this paper, we extend this result to odd minor version. That is, we prove that each graph G with independence number two contains K,(G)- as an odd minor for each integer with 1≤ < (G).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…