Irreducible pairings and indecomposable tournaments

DOI10.1007/s00373-024-02803-7zbMATH Open1544.05044MaRDI QIDQ6580491

Rim Romdhane, Cherifa Ben Salha, Houmem Belkhechine

Publication date: 29 July 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

transversalirreducibleindecomposablemodulepairingquasi-pairing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Partitions of sets (05A18) Transversal (matching) theory (05D15) Directed graphs (digraphs), tournaments (05C20) Total orders (06A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Primitivity is hereditary for 2-structures
• The asymptotic number of irreducible partitions
• The enumeration of irreducible combinatorial objects
• The enumeration of connected graphs and linked diagrams
• On a class of linked diagrams. I: Enumeration
• On a class of linked diagrams. II: Asymptotics
• Indecomposable graphs
• Graphs indecomposable with respect to the X-join
• Free cumulants and enumeration of connected partitions
• Tournaments with maximal decomposability
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• Decomposability index of tournaments
• Embedding tournaments in simple tournaments
• Some remarks on simple tournaments
• Decomposability and co-modular indices of tournaments
• Proportions of Irreducible Diagrams
• A Fast Algorithm for the Decomposition of Graphs and Posets
• An Algorithm for the Modular Decomposition of Hypergraphs
• Proportions of Irreducible Diagrams
• Simple one‐point extensions of tournaments
• Contribution a L'etude Du Probleme Des Timbres Poste
• Sur Un Problème De Configurations Et Sur Les Fractions Continues

This page was built for publication: Irreducible pairings and indecomposable tournaments