Unavoidable structures in infinite tournaments
From MaRDI portal
Publication:6602152
Recommendations
Cites work
- A combinatorial problem in geometry.
- A partition relation for successors of large cardinals
- A proof (involving Martin's axiom) of a partition relation
- A proof of Sumner's universal tournament conjecture for large tournaments
- Density of monochromatic infinite subgraphs
- scientific article; zbMATH DE number 3902685 (Why is no real title available?)
- scientific article; zbMATH DE number 3489125 (Why is no real title available?)
- scientific article; zbMATH DE number 3361883 (Why is no real title available?)
- Largest digraphs contained in all n-tournaments
- On Sets of Consistent Arcs in a Tournament
- On the unavoidability of oriented trees
- Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
- Ramsey upper density of infinite graphs
- Rectangular square-bracket operation for successor of regular cardinals
- Some counterexamples in the partition calculus
- Some problems in singular cardinals combinatorics
- Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
- Trees with few leaves in tournaments
- Upper density of monochromatic infinite paths
This page was built for publication: Unavoidable structures in infinite tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602152)