tailieunhanh - Báo cáo toán hoc:"Degree powers in graphs with a forbidden even cycle"

Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học tạp chí toán học quốc tế đề tài: Degree powers in graphs with a forbidden even cycle. | Degree powers in graphs with a forbidden even cycle Vladimir Nikiforov Department of Mathematical Sciences University of Memphis Memphis TN 38152 USA vnikifrv@ Submitted Dec 27 2008 Accepted Aug 11 2009 Published Aug 21 2009 Mathematics Subject Classifications 05C35 05C38 Abstract Let Cl denote the cycle of length l. For p 2 and integer k 1 we prove that the function Ộ k p n max E I uev G dp u G is a graph of order n containing no C2k 2 I satisfies Ộ k p n knp 1 o 1 . This settles a conjecture of Caro and Yuster. Our proof is based on a new sufficient condition for long paths. 1 Introduction Our notation and terminology follow 1 in particular Cl denotes the cycle of length l. For p 2 and integer k 1 Caro and Yuster 3 among other things studied the function Ộ k p n max V I uev G dG u G is a graph of order n without a C2k 2 1 and conjectured that Ộ k p n knp 1 o 1 . 1 The graph Kk Kn-k . the join of Kk and Kn-k gives Ộ k p n k n 1 p so to prove 1 a matching upper bound is necessary. We give such a bound in Corollary 3 below. Our main tool stated in Lemma 1 is a new sufficient condition for long paths. This result has other applications as well for instance the following spectral bound proved in 5 This research has been supported by NSF Grant DMS-0906634. THE ELECTRONIC JOURNAL OF COMBINATORICS 16 2009 R107 1 Let G be a graph of order n and p be the largest eigenvalue of its adjacency matrix. If G does not contain C2k 2 then p2 kp k n 1 . 2 Main results We write X for the cardinality of a finite set X. Let G be a graph and X and Y be disjoint sets of vertices of G. We write - V G for the vertex set of G and G for V G - eG X for the number of edges induced by X - eG X Y for the number of edges joining vertices in X to vertices in Y - G u for the graph obtained by removing the vertex u G V G - rG u for the set of neighbors of the vertex u and dG u for rG u . The main result of this note is the following lemma. Lemma 1 Suppose that k 1 and let the vertices

TÀI LIỆU LIÊN QUAN
TỪ KHÓA LIÊN QUAN
crossorigin="anonymous">
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.