Year-end Sale % OFF 
Abstract
AbstractHalin’s well-known grid theorem states that a graph G with a thick end must contain a subdivision of the hexagonal half-grid. We obtain the following strengthening when G is vertex-transitive and locally finite. Either G is quasi-isometric to a tree (and therefore has no thick end), or it contains a subdivision of the full hexagonal grid.
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 callSimilar Papers
Disclaimer: 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.
