Abstract
AbstractWe prove a theorem on path systems implying the conjecture of Bollobás that there exists a function f(k, m) (where k and m are natural numbers) satisfying the following: For each graph G of minimum degree at least f(k, m) there exists a graph H of minimum degree at least k such that G contains the graph obtained from H by subdividing each edge m times.
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.
