2020
DOI: 10.48550/arxiv.2004.00593
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Duality theorems for stars and combs II: Dominating stars and dominated combs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
3

Relationship

3
0

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…For example, a given vertex set U might be connected in a graph G by both a star and a comb, even with infinitely intersecting sets of leaves and teeth. To formalise this, let us say that a subdivided star S dominates a comb C if infinitely many of the leaves of S are also teeth of C. A dominating star in a graph G then is a subdivided star ⊆ S G that dominates some comb ⊆ C G; and a dominated comb in G is a comb ⊆ C G that is dominated by some subdivided star ⊆ S G. Thus, a star ⊆ S G is undominating in G if it is not dominating in G; and a comb ⊆ C G is undominated in G if it is not dominated in G. In the second and third paper of the series we determined structures whose existence is complementary to the existence of dominating stars, dominated combs or undominated combs [1,3].…”
Section: And This Paper)mentioning
confidence: 99%
“…For example, a given vertex set U might be connected in a graph G by both a star and a comb, even with infinitely intersecting sets of leaves and teeth. To formalise this, let us say that a subdivided star S dominates a comb C if infinitely many of the leaves of S are also teeth of C. A dominating star in a graph G then is a subdivided star ⊆ S G that dominates some comb ⊆ C G; and a dominated comb in G is a comb ⊆ C G that is dominated by some subdivided star ⊆ S G. Thus, a star ⊆ S G is undominating in G if it is not dominating in G; and a comb ⊆ C G is undominated in G if it is not dominated in G. In the second and third paper of the series we determined structures whose existence is complementary to the existence of dominating stars, dominated combs or undominated combs [1,3].…”
Section: And This Paper)mentioning
confidence: 99%
“…To formalise this, let us say that a subdivided star S dominates a comb C if infinitely many of the leaves of S are also teeth of C. A dominating star in a graph G then is a subdivided star S G ⊆ that dominates some comb C G ⊆ ; and a dominated comb in G is a comb C G ⊆ that is dominated by some subdivided star S G ⊆ . In the remaining three papers [1][2][3] of this series we shall find complementary structures to the existence of these substructures (again, with respect to some fixed set U ).…”
mentioning
confidence: 91%
“…In the second paper [2] of our series we determined structures whose existence is complementary to the existence of dominating stars or dominated combs-again in terms of normal trees or tree-decompositions.…”
Section: Introductionmentioning
confidence: 99%