Abstract
We prove that a locally cobipartite graph on n vertices contains a family of at most n cliques that cover its edges. This is related to Opsut's conjecture that states the competition number of a locally cobipartite graph is at most two.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have