arXiv:math/0501211 Abstract

arXiv:math/0501211 [math.CO]Abstract References Reviews Resources

The minimum number of 4-cliques in graphs with triangle-free complement

Published 2005-01-14Version 1

Write f(n) for the minimum number of 4-cliques in graphs of order n with triangle-free complement. Finding f(n) is a particular case of a problem raised by Erdos in 1962. We give an upper bound of f(n) and a matching lower bound when the graph is close to regular.

Comments: 8 pages

Categories: math.CO

Subjects: 05C35

Keywords: minimum number, triangle-free complement, upper bound, matching lower bound

Related articles: Most relevant | Search more

arXiv:math/9807022 [math.CO] (Published 1998-07-03)

The leafage of a chordal graph

In-Jen Lin, Terry A. McKee, Douglas B. West

arXiv:1103.0067 [math.CO] (Published 2011-03-01)

Cycle-saturated graphs with minimum number of edges

Zoltan Furedi, Younjin Kim

arXiv:1203.2723 [math.CO] (Published 2012-03-13)