Strong immersion is a well-quasi-ordering for semicomplete digraphs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier
Journal Articles Journal of Graph Theory Year : 2019

Strong immersion is a well-quasi-ordering for semicomplete digraphs

Abstract

We prove that the strong immersion order is a well‐quasi‐ordering on the class of semicomplete digraphs, thereby strengthening a result of Chudnovsky and Seymour (2011, J. Comb. Theory, Series B, 101, 47–53) that this holds for the class of tournaments.

Domains

Discrete Mathematics [cs.DM]

Christophe Paul  : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01918986

Submitted on : Monday, November 12, 2018-10:01:58 AM

Last modification on : Tuesday, July 23, 2024-10:50:18 AM

Consult the full text

Dates and versions

lirmm-01918986 , version 1 (12-11-2018)

Identifiers

Cite

Florian Barbero, Christophe Paul, Michał Pilipczuk. Strong immersion is a well-quasi-ordering for semicomplete digraphs. Journal of Graph Theory, 2019, 90, pp.484-496. ⟨10.1002/jgt.22408⟩. ⟨lirmm-01918986⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS ALGCO LIRMM TDS-MACS MIPS UNIV-MONTPELLIER ANR
80 View
0 Download

Altmetric

Share

More