Abstract

In this paper we study the edge-clique cover number, θe(⋅), of the tensor product Kn×Kn. We derive an easy lowerbound for the edge-clique number of graphs in general. We prove that, when n is prime θe(Kn×Kn) matches the lowerbound. Moreover, we prove that θe(Kn×Kn) matches the lowerbound if and only if a projective plane of order n exists. We also show an easy upperbound for θe(Kn×Kn) in general, and give its limiting value when the Riemann hypothesis is true. Finally, we generalize our work to study the edge-clique cover number of the higher-dimensional tensor product Kn×Kn×⋯×Kn.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.