Reinhard Diestel, Raphael W. Jacobs, Paul Knappe, Paul Wollan
{"title":"墙强浸入的网格定理","authors":"Reinhard Diestel, Raphael W. Jacobs, Paul Knappe, Paul Wollan","doi":"10.1002/jgt.23245","DOIUrl":null,"url":null,"abstract":"<p>We show that a graph contains a large wall as a strong immersion minor if and only if the graph does not admit a tree-cut decomposition of small “width”, which is measured in terms of its adhesion and the path-likeness of its torsos.</p>","PeriodicalId":16014,"journal":{"name":"Journal of Graph Theory","volume":"110 1","pages":"23-32"},"PeriodicalIF":0.9000,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23245","citationCount":"0","resultStr":"{\"title\":\"A Grid Theorem for Strong Immersions of Walls\",\"authors\":\"Reinhard Diestel, Raphael W. Jacobs, Paul Knappe, Paul Wollan\",\"doi\":\"10.1002/jgt.23245\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>We show that a graph contains a large wall as a strong immersion minor if and only if the graph does not admit a tree-cut decomposition of small “width”, which is measured in terms of its adhesion and the path-likeness of its torsos.</p>\",\"PeriodicalId\":16014,\"journal\":{\"name\":\"Journal of Graph Theory\",\"volume\":\"110 1\",\"pages\":\"23-32\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2025-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1002/jgt.23245\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Graph Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23245\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23245","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
We show that a graph contains a large wall as a strong immersion minor if and only if the graph does not admit a tree-cut decomposition of small “width”, which is measured in terms of its adhesion and the path-likeness of its torsos.
期刊介绍:
The Journal of Graph Theory is devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences.
A subscription to the Journal of Graph Theory includes a subscription to the Journal of Combinatorial Designs .