Linear -binding functions for \P3 P2, gem\-free graphs
Abstract
Finding families that admit a linear -binding function is a problem that has interested researchers for a long time. Recently, the question of finding linear subfamilies of 2K2-free graphs has garnered much attention. In this paper, we are interested in finding a linear subfamily of a specific superclass of 2K2-free graphs, namely (P3 P2)-free graphs. We show that the class of \P3 P2,gem\-free graphs admits f=2ω as a linear -binding function. Furthermore, we give examples to show that the optimal -binding function f*≥ 5ω(G)4 for the class of \P3 P2, gem\-free graphs and that the -binding function f=2ω is tight when ω=2 and 3.
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.