A note on the Gy´arf´as-Sumner conjecture

The Gy´arf´as-Sumner conjecture says that for every tree T and every integer t ≥ 1, if G is a graph with no clique of size t and with suﬃciently large chromatic number, then G contains an induced subgraph isomorphic to T . This remains open, but we prove that under the same hypotheses, G contains a subgraph H isomorphic to T that is “path-induced”; that is, for some distinguished vertex r , every path of H with one end r is an induced path of G .


Introduction
The Gyárfás-Sumner conjecture says [2,14]: 1.1 Conjecture: For every tree T , and every integer t ≥ 1, if G is a graph with no induced subgraph isomorphic to T , and with no clique of size t, then its chromatic number is bounded.
Let T be a tree and let r be a vertex of T (we call (T, r) a rooted tree).Suppose that φ is an isomorphism from T to a subgraph of a graph G (not necessarily induced).We say that φ is a path-induced copy of (T, r) in G if for every path P of T with one end r, the image of P under φ is an induced path in G.The notion of being path-induced lies partway between being a subgraph and being an induced subgraph.
1.1 remains out of reach.However, we will show here that it is true if instead of excluding an induced tree we exclude a path-induced tree.Our main result is the following.
1.2 For every rooted tree (T, r), and every integer t ≥ 1, if G is a graph with no path-induced copy of (T, r), and with no clique of size t, then its chromatic number is bounded.
We prove 1.2 in the next section, and give further discussion in the final section.

The proof
We denote the chromatic number of G by χ(G), and for X ⊆ V (G), we write χ(X) for χ(G[X]).We need the following lemma.It is a special case of a theorem of [1], but we give the proof since it is short.For c ≥ 1, we say X ⊆ V (G) is a c-creature of G if every vertex in X has fewer than c neighbours in V (G) \ X.

For all integers
Thus we have extended κ to a (χ(G) − 1)-colouring of G, a contradiction.This proves 2.1.
If φ is a path-induced copy of some (T, r), we denote by V (φ) the vertex set of its image, that is, the set of all vertices φ(h) (h ∈ V (T )).For integers d ≥ 2 and k ≥ 1, let (T k d , r) be the rooted tree in which the root r has degree d, every vertex has degree d or 1, and every path from r to a leaf has length k.We will prove: and τ ≥ 0 be integers.Then there exists K with the following property.Let G be a graph, such that for every v ∈ V (G), χ(N (v)) ≤ τ , where N (v) is the set of neighbours of v. Let v ∈ V (G).Then either G admits a path-induced copy φ of (T k d , r) with φ(r) = v, or there exists a (1 and inductively for j ≥ 2, define f (j) = f (j − 1)c(j − 1) + τ .We will prove by induction on k that K = f (k) satisfies the theorem.
If k = 1, and v has d neighbours in G, then there is a path-induced copy φ of (T k d , r) with φ(r) = v; and otherwise {v} is a d-creature.Thus we may assume that k ≥ 2 and the result holds as required, so we may assume that |A| < d.Consequently the union of the sets Let us denote this union by W .
For each u ∈ N (v) \ A, from the inductive hypothesis, applied to the subgraph induced on ({u} ∪ M (v)) \ W , there is a c(k − 1)-creature X u of this subgraph with u ∈ X u and with χ(X u ) ≤ f (k − 1).Let X be the union of {v} and all the sets X u (u ∈ N (v) \ A).We claim that X satisfies the theorem.
First, since X contains all vertices of N (v) \ A, it follows that v has |A| < d ≤ c(k) neighbours in V (G) \ X.Every other vertex x ∈ X belongs to one of the sets X u where u ∈ N (v) \ A, and so has fewer than c(k − 1) neighbours in M (v) \ (X u ∪ W ), and consequently has fewer than c(k − 1) in V (G) \ (X ∪ W ).Moreover, it has at most d k neighbours in W because |W | ≤ d k , and so has in total fewer than c(k − 1) with chromatic number at most f (k − 1), contrary to 2.1 and the minimality of B. This proves that

This proves (2).
From (1) and (2), X satisfies the theorem.This proves 2.2.Now we can deduce 1.2, which we restate: 2.3 For every rooted tree (T, r) and every integer t ≥ 1, if G is a graph with no clique of size t and with sufficiently large chromatic number, then G admits a path-induced copy of (T, r).
Proof.We may assume that (T, r) equals (T k d , r) for some choice of d ≥ 2 and k ≥ 1.We proceed by induction on t; and so may assume that there exists τ ≥ 0 such that if G is a graph with no clique of size t − 1, and χ(G) > τ , then G admits a path-induced copy of (T, r).Choose f (k) as in 2.2.We claim that if G is a graph with no clique of size t that does not admit a path-induced copy of (T, r) then χ(G) We may assume that G is critical with its chromatic number; that is, for every nonempty subset This proves 2.3.

Strengthenings
In this final section, we discuss possible strengthenings of 1.2.
One can refine 1.2 a little, and we first give a sketch of this.Start with a graph G with bounded clique number and large (really really huge!) chromatic number.For fixed k, d, we can apply 1.2 to get a path-induced copy of (T k D , r) in G for some huge value of D, and then use Ramsey arguments to get a path-induced copy of T k d where we have some control over the edges that stop this subgraph being induced.For instance, since there is a bound on the maximum size of a clique, each vertex of the tree that has children has a large (say size D ′ ) set of children that is stable in G; and the set of vertices such that all their ancestors belong to the selected stable subsets forms a path-induced copy of (T k D ′ , r) in which for every vertex, its set of children is stable in G.We can also arrange, using the bipartite Ramsey theorem, that for every two vertices of the tree at the same height, the children of the first are either completely adjacent, or completely nonadjacent, to the children of the second.And then we can get a path-induced copy of (T k D ′′ , r), for some huge D ′′ , such that for each vertex, its set of grandchildren is stable in G.And so on: we can arrange that for each i, the set of vertices at distance i from the root is a stable set.(Let us call this being level-stable.) We can also arrange, using the bipartite Ramsey theorem, that for every two vertices of the tree that are not leaves, even if their height is different, the children of the first are either completely adjacent, or completely nonadjacent, to the children of the second.(The argument here is more tricky: it is important to fix up pairs in the right order, but we omit the details.) But we can go further.Say two vertices u, v of the tree are incomparable if neither is an ancestor of the other; and let d(u, v) denote the distance between u, v in the tree.If u, v belong to the tree, let w be their "join" (their common ancestor furthest from the root), and let a = d(u, r), b = d(v, r) and c = d(w, r).The triple (a, b, c) describes the pair u, v up to isomorphisms of the tree.But we need a little more information.For each vertex, choose a linear order of its set of children.So now, if u, v are incomparable, then they descend from different children (say u ′ , v ′ respectively) of their join w, and one of these is earlier than the other in the linear order of the children of w.If u ′ is earlier than v ′ we say u is earlier than v. Let us say that the type of an unordered pair {u, v} (where u, v are incomparable) is the triple (a, b, c) defined as before, where u is earlier than v.
Let us say a path-induced copy of T r d in G is type-uniform if the adjacency of each incomparable pair of vertices depends only on their type; in other words, if {u, v} and {u ′ , v ′ } have the same type, then they are both adjacent or both nonadjacent pairs.One can use more Ramsey arguments (we omit the details, which are straightforward) to arrange, again by reducing D, that the adjacency of each pair of vertices depends only on their type; in other words, if {u, v} and {u ′ , v ′ } have the same type, then they are both adjacent or both nonadjacent pairs.In conclusion, then, we deduce: 3.1 For all k, t ≥ 1 and d ≥ 2, if G is a graph with no clique of size t and with sufficiently large chromatic number, then G admits a path-induced, level-stable, type-uniform copy of (T k d , r).
Here is another way in which we might strengthen 1.2: can we obtain polynomial bounds?There is an analogous problem where we exclude the complete bipartite graph K t,t as a subgraph, instead of excluding K t , and the following was shown in [11]: 3.2 For every tree T , there is a polynomial f (t) such that for every integer t ≥ 1, if G has no induced subgraph isomorphic to T and no subgraph isomorphic to K t,t , then G has average degree at most f (t).This is an improvement of a result of Kierstead and Penrice [5], who proved that there is a function f (t) as in 3.2, not necessarily a polynomial; and that in turn was an improvement of a theorem of Rödl (see [4,5,6]), who proved the same with average degree replaced by chromatic number.Is there any hope for a comparable strengthening of 1.2?
3.2 assumes that G does not contain K t,t as a subgraph.In 1.2 we replace this by the much weaker hypothesis that the clique number of G is bounded, although in compensation we must weaken the conclusion, replacing the bound on average degree with a bound on chromatic number.This change is necessary: K n,n has large minimal degree, but no K 3 and no path-induced copy of P 4 .
But we could still ask for a polynomial bound on chromatic number.Indeed, it is possible that the Gyárfás-Sumner conjecture holds with polynomial bounds (in other words, 1.1 with a bound on chromatic number that is polynomial in t).This has recently been shown for a few trees, including every tree that does not contain the five-vertex path as an induced subgraph [12].However, the fivevertex path appears to be a sticking point.Here, the best current bound is slightly superpolynomial (see [13] for this and for related discussion): 3.3 If G does not contain the five-vertex path P 5 as an induced subgraph, and has clique number t, then χ G ≤ t log 2 t .
If P is a path and r is one end of P then a graph G contains a path-induced copy of (P, r) if and only if it contains an induced copy of P .Thus obtaining polynomial bounds in 1.2 even for P 5 would also require an improvement of 3.3.