Abstract
We only consider finite structures. With every totally ordered set V and a subset P of \(\left( {\begin{array}{c}V\\ 2\end{array}}\right) \), we associate the underlying tournament \(\textrm{Inv}({\underline{V}}, P)\) obtained from the transitive tournament \({\underline{V}}:=(V, \{(x,y) \in V \times V: x < y \})\) by reversing P, i.e., by reversing the arcs (x, y) such that \(\{x,y\} \in P\). The subset P is a pairing (of \(\cup P\)) if \(|\cup P| = 2|P|\), a quasi-pairing (of \(\cup P\)) if \(|\cup P| = 2|P|-1\); it is irreducible if no nontrivial interval of \(\cup P\) is a union of connected components of the graph \((\cup P, P)\). In this paper, we consider pairings and quasi-pairings in relation to tournaments. We establish close relationships between irreducibility of pairings (or quasi-pairings) and indecomposability of their underlying tournaments under modular decomposition. For example, given a pairing P of a totally ordered set V of size at least 6, the pairing P is irreducible if and only if the tournament \(\textrm{Inv}({\underline{V}}, P)\) is indecomposable. This is a consequence of a more general result characterizing indecomposable tournaments obtained from transitive tournaments by reversing pairings. We obtain analogous results in the case of quasi-pairings.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Beissinger, J.S.: The enumeration of irreducible combinatorial objects. J. Comb. Theory Ser. A 38, 143–169 (1985)
Belkhechine, H.: Decomposability index of tournaments. Discrete Math. 340, 2986–2994 (2017)
Belkhechine, H., Ben Salha, C.: Decomposability and co-modular indices of tournaments. Discrete Math. 344, 112272 (2021)
Belkhechine, H., Boudabbous, I.: Indecomposable tournaments and their indecomposable subtournaments on 5 and 7 vertices. Ars Comb. 108, 493–504 (2013)
Ben Salha, C.: Tournaments with maximal decomposability. Discrete Math. 345, 112972 (2022)
Bender, E.A., Odlyzko, A.M., Richmond, L.B.: The asymptotic number of irreducible partitions. Eur. J. Comb. 6, 1–6 (1985)
Bonizzoni, P., DellaVedova, G.: An algorithm for the modular decomposition of hypergraphs. J. Algorithms 32, 65–86 (1999)
Buer, H., Möhring, R.H.: A fast algorithm for the decomposition of graphs and posets. Math. Oper. Res. 8, 170–184 (1983)
Cournier, A., Habib, M.: An efficient algorithm to recognize prime undirected graphs. In E. Mayer (Ed.) Graph-Theoretic Concepts in Computer Science, Vol. 657. Lecture Notes in Computer Science. Springer, New York, pp. 212–224 (1992)
Ehrenfeucht, A., Rozenberg, G.: Primitivity is hereditary for 2-structures. Theor. Comput. Sci. 70, 343–358 (1990)
Erdős, P., Fried, E., Hajnal, A., Milner, E.C.: Some remarks on simple tournaments. Algebra Univ. 2, 238–245 (1972)
Erdős, P., Hajnal, A., Milner, E.C.: Simple one-point extensions of tournaments. Mathematika 19, 57–62 (1972)
Hsieh, W.N.: Proportions of Irreducible Diagrams. Stud. Appl. Math. 52, 277–283 (1973)
Ille, P.: Indecomposable graphs. Discrete Math. 173, 71–78 (1997)
Kleitman, D.J.: Proportions of irreducible diagrams. Stud. Appl. Math. 49, 297–299 (1970)
Lehner, F.: Free cumulants and enumeration of connected partitions. Eur. J. Comb. 23, 1025–1031 (2002)
Moon, J.W.: Embedding tournaments in simple tournaments. Discrete Math. 2, 389–395 (1972)
Nijenhuis, A., Wilf, H.S.: The enumeration of connected graphs and linked diagrams. J. Comb. Theory Ser. A 27, 356–359 (1979)
Schmerl, J.H., Trotter, W.T.: Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures. Discrete Math. 113, 191–205 (1993)
Stein, P.R.: On a class of linked diagrams, I. Enumeration. J. Comb. Theory Ser. A 24, 357–366 (1978)
Stein, P.R., Everett, C.J.: On a class of linked diagrams II. Asymptotics. Discrete Math. 21, 309–318 (1978)
Sumner, D.P.: Graphs indecomposable with respect to the \(X\)-join. Discrete Math. 6, 281–298 (1973)
Touchard, J.: Contribution á l’étude du problème des timbres-poste. Can. J. Math. 2, 385–398 (1950)
Touchard, J.: Sur un problème de configurations et sur les fractions continues. Can. J. Math. 4, 2–25 (1952)
Acknowledgements
The authors would like to thank an anonymous referee for his careful reading of the manuscript and his comments.
Funding
No funding was received to assist with the preparation of this manuscript.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors have no financial or non-financial interests to declare.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Belkhechine, H., Ben Salha, C. & Romdhane, R. Irreducible Pairings and Indecomposable Tournaments. Graphs and Combinatorics 40, 74 (2024). https://doi.org/10.1007/s00373-024-02803-7
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00373-024-02803-7