Extremal Graphs Without 4-Cycles

Details Extremal Graphs Without 4-Cycles Extremal Graphs Without 4-Cycles

2012-01-24

arxiv.org/abs/1201.4912v1

Mathematics

Combinatorics

9 pages

Scientific paper

We prove an upper bound for the number of edges a C4-free graph on q^2 + q
vertices can contain for q even. This upper bound is achieved whenever there is
an orthogonal polarity graph of a plane of even order q.

Affiliated with

Also associated with

No associations

Rating

Extremal Graphs Without 4-Cycles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Extremal Graphs Without 4-Cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extremal Graphs Without 4-Cycles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-106554