Abstract
AbstractA probabilistic result of Bollobás and Catlin concerning the largest integer p so that a subdivision of Kp is contained in a random graph is generalized to a result concerning the largest integer p so that a subdivision of Ap is contained in a random graph for some sequence A1, A2,… of graphs such that Ai+1 contains a subdivision of Ai. A similar result is proved for subdivisions with odd paths or cycles. The result is applied to disprove a conjecture of Chartrand, Geller, and Hedetniemi. The maximum number of edges in a graph without a subdivision of Kp, p = 4, 5, with odd paths or cycles is determined.
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.
