![](/files/happy5.png)
Linhares Sales, Claudia
Antidirected trees in digraphs ★★
Author(s): Addario-Berry; Havet; Linhares Sales; Reed; Thomassé
An antidirected tree is an orientation of a tree in which every vertex has either indegree 0 or outdergree 0.
Conjecture Let
be a digraph. If
, then
contains every antidirected tree of order
.
![$ D $](/files/tex/b8653a25aff72e3dacd3642492c24c2241f0058c.png)
![$ |A(D)| > (k-2) |V(D)| $](/files/tex/9d92913ac31fe6777abefdb2c40e6ec0c94bcf8a.png)
![$ D $](/files/tex/b8653a25aff72e3dacd3642492c24c2241f0058c.png)
![$ k $](/files/tex/c450c3185f7285cfa0b88d3a903c54f7df601201.png)
Keywords:
![Syndicate content Syndicate content](/misc/feed.png)