Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

This is quite a soft question. I'm looking for any properties that a graph $G$ on $n$ vertices satisfying the following conditions might have:

  1. $\chi(G)=n-2$
  2. $|E(G)|>(n^2-3n+6)/2$

Clearly, for example, $n$ must be greater than 3, the clique number of $G$ must be less than or equal to $n-2$, and the density of the graph must be greater than: $\displaystyle\frac{n^2-3n+6}{n^2-n}$.

Are there any nice characterizations of such graphs?

share|cite|improve this question
What do you mean by "order"? – draks ... Mar 9 '12 at 11:03
I mean number of vertices. I'll edit the question. – mrb Mar 9 '12 at 11:10
With that many edges, it might be easier to characterize the complement. – Gerry Myerson Mar 9 '12 at 11:33
By $\chi(G)$ you mean the chromatic number or the Euler charateristic? – draks ... Mar 9 '12 at 11:38
I think order is standard and $\chi(G)$ is standard for chromatic number, and Euler characteristic couldn't possibly be n - 2, could it? – Graphth Mar 9 '12 at 14:59

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.