Abstract
A conjecture of Gallai states that if a graphG onn vertices contains no subgraph isomorphic to a wheel then the number of triangles inG is at mostn 2/8. In this note it is shown that this number is at most (1 +o(1))n 2/7, and in addition we exhibit a large family of graphs that shows that if the conjecture is true then there are many extremal examples.
Sign-in/Register to access full text options 
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.
