Abstract
AbstractErdős et al. made conjectures for the maximum diameter of connected graphs without a complete subgraph , which have order and minimum degree . Settling a weaker version of a problem, by strengthening the ‐free condition to ‐colorable, we solve the problem for and using a unified linear programming duality approach. The case is a substantial simplification of the result of Czabarka et al.
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.
