Abstract
We give various results related to the following conjecture: If a graphG does not contain more thank pairwise edge-disjoint triangles, then there exists a set of at most 2k edges that meets all triangles ofG.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
