Premium
The structure of graphs with no W 4 immersion
Author(s) -
DeVos Matt,
Malekian Mahdieh
Publication year - 2021
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.22677
Subject(s) - mathematics , combinatorics , structured program theorem , immersion (mathematics) , discrete mathematics , graph , class (philosophy) , computer science , pure mathematics , artificial intelligence
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 et 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 , 3immersion.