Abstract
It is shown that there is a graph L with n vertices and at least n 1.36 edges such that it contains neither L 3 nor K 2, 3 but every subgraph with 2n 4 3 (log n) 2 edges contains a C 4, (n > n O) . Moreover, chromatic number of G is at least n 0.1.
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.
