2000 character limit reached
Duality theorems for stars and combs I: Arbitrary stars and combs
Published 1 Apr 2020 in math.CO | (2004.00594v3)
Abstract: Extending the well-known star-comb lemma for infinite graphs, we characterise the graphs that do not contain an infinite comb or an infinite star, respectively, attached to a given set of vertices. We offer several characterisations: in terms of normal trees, tree-decompositions, ranks of rayless graphs and tangle-distinguishing separators.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.