pith. sign in

arxiv: 1810.12863 · v1 · pith:56YKANA2new · submitted 2018-10-30 · 🧮 math.CO

The structure of graphs with no W₄ immersion

classification 🧮 math.CO
keywords graphsimmersionstructuretheoremclassgivesresultstronger
0
0 comments X
read the original abstract

This paper gives a precise structure theorem for the class of graphs which do not contain $W_4$ as an immersion. This strengthens a previous result of Belmonte at al. that gives a rough description of this class. In fact, we prove a stronger theorem concerning rooted immersions of $W_4$ where one terminal is specified in advance. This stronger result is key in a forthcoming structure theorem for graphs with no $K_{3,3}$ immersion.

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.