Extremal Graphs Without 4-Cycles
classification
🧮 math.CO
keywords
boundevengraphupperachievedc4-freecontaincycles
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.