Abstract

We present a new construction for arbitrarily large graphs with n vertices, ( n 2 ) 3 2 edges and no C 4, ( n 2 ) 4 3 edges and no C 6, and ( n 2 ) 6 5 edges and no C 10.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call