Trees with three leaves are (\(n+1\))-unavoidable
type: Item
instance of: scholarly article
title: Trees with three leaves are (\(n+1\))-unavoidable
zbMATH Open document ID: 1043.05057
DOI: 10.1016/S0166-218X(03)00366-4
published in: Discrete Applied Mathematics
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 2083782
zbMATH Keywords: Tournament
zbMATH Keywords: Unavoidable
zbMATH Keywords: Tree
author: Stéphan Ceroi
author: Frédéric Havet
MaRDI profile type: Publication
cites work: Trees in tournaments
cites work: On unavoidability of trees with \(k\) leaves
cites work: Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
cites work: Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture
cites work: On avoidable and unavoidable claws
cites work: Q3950574
cites work: Paths and Cycles in Tournaments
full work available at URL: s0166-218x(03)00366-4
OpenAlex ID: W1976444262
description: scientific article; zbMATH DE number 2083782