Minimal antichains in well-founded quasi-orders with an application to tournaments
type: Item
instance of: scholarly article
title: Minimal antichains in well-founded quasi-orders with an application to tournaments
zbMATH Open document ID: 1025.06001
author: Gregory Cherlin
author: Brenda J. Latka
published in: Journal of Combinatorial Theory. Series B
publication date: 2002-12-10T00:00:00Z
Mathematics Subject Classification ID: 06A07
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 03C50
zbMATH DE Number: 1843730
zbMATH Keywords: countable homogeneous directed graphs
zbMATH Keywords: finite tournaments
zbMATH Keywords: forbidden tournaments
zbMATH Keywords: homogeneous structures
zbMATH Keywords: minimal antichains
zbMATH Keywords: well-founded quasi-order
zbMATH Keywords: finiteness theorem
MaRDI profile type: Publication
full work available at URL: jctb.2000.1986
OpenAlex ID: W2115667485
cites work: Q4272117
cites work: Q3136738
cites work: Q3222886
cites work: The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
cites work: Q4026891
cites work: Q4881840
cites work: Recognizing claw-free perfect graphs
cites work: Stable set bonding in perfect graphs and parity graphs
cites work: A Problem on Tournaments
cites work: On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
cites work: Q4023737
cites work: Countable homogeneous relational structures and ℵ0-categorical theories
cites work: Ordering by Divisibility in Abstract Algebras
cites work: Q5594621
cites work: The NP-completeness column: An ongoing guide
cites work: Finitely constrained classes of homogeneous directed graphs
cites work: Q4871034
cites work: Structure theorem for tournaments omitting N5
cites work: Q5734436
cites work: Minimal Forbidden Subgraphs of Unimodular Multicommodity Networks
DOI: 10.1006/JCTB.2000.1986
description: scientific article; zbMATH DE number 1843730