Abstract
Erdős asked if the removal of few edges in a large 4-color-critical graph always leaves a 3-chromatic graph. Erdős and Hajnal asked if a graph is 3-colorable if all its induced subgraphs can be made bipartite by the omission of few edges (relative to the number of vertices). We answer both problems, which are stated in Bollobas’ monograph Extremal Graph Theory from 1978, in the negative.
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.
