A well-quasi-order for tournaments

Authors:
Maria Chudnovsky;Paul Seymour
Affiliations:
Columbia University, New York, NY 10027, United States;Princeton University, Princeton, NJ 08544, United States
Venue:
Journal of Combinatorial Theory Series B
Year:
2011

Citing 3
Cited 2

Eulerian digraph immersion

Eulerian digraph immersion
Graph Minors. XX. Wagner's conjecture

Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Graph minors XXIII. Nash-Williams' immersion conjecture

Journal of Combinatorial Theory Series B

Well-quasi-ordering hereditarily finite sets

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Tournament immersion and cutwidth

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

Abstract

A digraph H is immersed in a digraph G if the vertices of H are mapped to (distinct) vertices of G, and the edges of H are mapped to directed paths joining the corresponding pairs of vertices of G, in such a way that the paths are pairwise edge-disjoint. For graphs the same relation (using paths instead of directed paths) is a well-quasi-order; that is, in every infinite set of graphs some one of them is immersed in some other. The same is not true for digraphs in general; but we show it is true for tournaments (a tournament is a directed complete graph).