On the number of maximal independent sets and maximal induced bipartite subgraphs in K4-free graphs

Abstract

Let G be a K4-free graph of order n and let k be an integer with 0≤ k≤ n. We show the existence of positive constants η and such that G has at most (4-η)(5-η)k-n(5-η)n-(4-η)k maximal independent sets of order k and at most O((12-)n4) maximal induced bipartite subgraphs.

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…