Minimal antichains in well-founded quasi-orders with an application to tournaments
DOI10.1006/jctb.2000.1986zbMath1025.06001OpenAlexW2115667485MaRDI QIDQ1850501
Gregory L. Cherlin, Brenda J. Latka
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2000.1986
finiteness theoremhomogeneous structurescountable homogeneous directed graphsfinite tournamentsforbidden tournamentsminimal antichainswell-founded quasi-order
Combinatorics of partially ordered sets (06A07) Directed graphs (digraphs), tournaments (05C20) Models with special properties (saturated, rigid, etc.) (03C50)
Related Items (5)
Cites Work
- Recognizing claw-free perfect graphs
- Stable set bonding in perfect graphs and parity graphs
- Minimal Forbidden Subgraphs of Unimodular Multicommodity Networks
- On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
- Finitely constrained classes of homogeneous directed graphs
- The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
- Structure theorem for tournaments omitting N5
- A Problem on Tournaments
- Countable homogeneous relational structures and ℵ0-categorical theories
- Ordering by Divisibility in Abstract Algebras
- The NP-completeness column: An ongoing guide
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Minimal antichains in well-founded quasi-orders with an application to tournaments