Recognition: unknown
Minors in expanding graphs
classification
🧮 math.CO
keywords
graphsexpandingresultsareaclassesclique-minorclique-minorscontain
read the original abstract
Extending several previous results we obtained nearly tight estimates on the maximum size of a clique-minor in various classes of expanding graphs. These results can be used to show that graphs without short cycles and other H-free graphs contain large clique-minors, resolving some open questions in this area.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.