Ordinary and spectral extremal problems on vertex disjoint copies of even fans

Abstract

Let ex(n, F) and spex(n, F) be the maximum size and spectral radius among all F-free graphs with fixed order n, respectively. A fan is a graph P1 Ps (join of a vertex and a path of order s) for s 3, and it is called an even fan if s is even. In this paper, we study ex(n,t(P1 P2k)), spex(n,t(P1 P2k)) with t 1 and k 3 and characterize the corresponding extremal graphs for sufficiently large n.

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…