Document Type

Article

Department/Program

Mathematics

Journal Title

European Journal of Combinatorics

Pub Date

2012

Volume

33

Issue

6

First Page

1078

Abstract

Let A be an Abelian group, n > 3 be an integer, and ex(n, A) be the maximum integer such that every n-vertex simple graph with at most ex(n, A) edges is not A-connected. In this paper, we study ex(n, A) for IAI > 3 and present lower and upper bounds for 3 < IAI 5. 0 2012 Elsevier Ltd. All rights reserved.

DOI

10.1016/j.ejc.2012.01.003

Download

Share Feedback

Share

COinS