Abstract
A graph K is called multiplicative if whenever a categorical product of two graphs admits a homomorphism to K, then one of the factors also admits a homomorphism to K. We prove that all circular graphs K k / d such that k / d < 4 are multiplicative. This is done using semi-lattice endomorphism in (the skeleton of) the category of graphs to prove the multiplicativity of some graphs using the known multiplicativity of the odd cycles.
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 callDisclaimer: 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.
