Looking for source: Max num of edges of graph with given number of vertices and given girth

Question

In a paper I am reading, the author states:

"It is simple and well known that a graph of girth $g$ and $q$ vertices has at most $q^{1+(O(1)/g)}$ edges"

He says that a proof can be found on Extremal Graph Theory, by Bela Bollobas.

However, I do not have easy access to that book.

Could someone please direct me to a more common graph theory book that has this result or some equivalent result?

btw, this is a cross-post. I have tryed math.stackexchange first, because the question is a bit basic, but got no response — josinalvo, Commented Jul 6, 2016 at 15:21
It must be this: math.stackexchange.com/questions/1850563/… You should wait at least a few days before deciding to cross-post. Also: at each site where you post a question, always link to every other site where the same question is posted. (This means $n(n-1)$ links in all, if you have posted at $n$ sites.) — Todd Trimble, Commented Jul 6, 2016 at 16:21

Adam Zsolt Wagner · Accepted Answer · 2016-07-06 16:01:17Z

2

I recommend you have a look at the excellent lecture notes of David Conlon, found at:

In particular you will be interested in Lectures 10 and 11, which contain an answer to your question.

answered Jul 6, 2016 at 16:01

Adam Zsolt Wagner

1011 silver badge4 bronze badges

Add a comment |

1 Answer 1