Skip to main content
Log in

Transversals of Total Strict Linear Orders

  • Published:
Order Aims and scope Submit manuscript

Abstract

Given a set M, let \({\mathcal O}(M)\) be the set of all the total strict linear orders on M and, given an integer 2 ≤ k ≤|M|, let \({\mathcal O}_{k}(M) = \{{\mathbf R} \in {\mathcal O}(N) : \text {\textit {N} is a \textit {k}-subset of \textit {M}}\}\), that is, let \({\mathcal O}_{k}(M)\) be the family of all the total strict linear orders on each of all the k-subsets of M. A subset \({\mathcal T}\subseteq {\mathcal O}_{k}(M)\) will be called congruent if given any pair \(\{a,b\}\subseteq M\), if for some \({\mathbf R} \in {\mathcal T}\) we have (a,b) ∈R, then for every \({\mathbf Q}\in {\mathcal T}\) we have (b,a)∉Q. A subset \({\mathcal T}\subseteq {\mathcal O}_{k}(M)\) will be called a k-transversal of \({\mathcal O}(M)\) if for every \({\mathbf R} \in {\mathcal O}(M)\) there is \({\mathbf Q} \in {\mathcal T}\) such that either \({\mathbf Q} \subseteq {\mathbf R}\) or \({\mathbf Q}^{-}\subseteq {\mathbf R}\) (where Q = {(b,a) : (a,b) ∈Q} is the inverse order of Q). A subset \({\mathcal T}\subseteq {\mathcal O}_{k}(M)\) will be called a congruent k-transversal of \({\mathcal O}(M)\) if \({\mathcal T}\) is congruent and is a k-transversal of \({\mathcal O}(M)\). In this note we characterize, in terms of 2-arc-colourings of digraphs, the sets of congruent k-transversals of a given set \({\mathcal O}(M)\). Also we show some relations between these structures with the diagonal Ramsey numbers and with the chromatic number.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer Monographs in Mathematics, London (2009)

    Book  Google Scholar 

  2. Erdős, P., Szekeres, G.: A combinatorial problem in geometry. Compos. Math. 2, 463–470 (1935)

    MathSciNet  MATH  Google Scholar 

  3. Seidenberg, A.: A simple proof of a theorem of Erdős and Szekeres. J. London Mathe. Soc. s1-34, 352 (1959)

    Article  MathSciNet  Google Scholar 

Download references

Funding

Research partially supported by PAPIIT-México project IN107218 and CONACyT-México project A1-S-12891.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Juan Jose Montellano-Ballesteros.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Montellano-Ballesteros, J.J. Transversals of Total Strict Linear Orders. Order 39, 7–13 (2022). https://doi.org/10.1007/s11083-021-09560-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-021-09560-9

Keywords

Navigation