Some unavoidable subdigraphs of tournaments
From MaRDI portal
Recommendations
Cited in
(16)- Antidirected paths in 5-chromatic digraphs
- Subdivisions of digraphs in tournaments
- Claws in digraphs
- Impartial digraphs
- Tournaments whose indecomposability graph admits a vertex cover of size 2.
- Embedding tournaments
- scientific article; zbMATH DE number 4027498 (Why is no real title available?)
- scientific article; zbMATH DE number 4112621 (Why is no real title available?)
- Configurations inévitables dans un tournoi indécomposable
- On homomorphisms to acyclic local tournaments
- scientific article; zbMATH DE number 841646 (Why is no real title available?)
- SUBTOURNAMENTS ISOMORPHIC TO W5OF AN INDECOMPOSABLE TOURNAMENT
- Unavoidable subtournaments in large tournaments with no homogeneous sets
- scientific article; zbMATH DE number 4183436 (Why is no real title available?)
- Claws contained in all n-tournaments
- Oriented Ramsey numbers of some sparse graphs
This page was built for publication: Some unavoidable subdigraphs of tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3791170)