Irreducible pairings and indecomposable tournaments

DOI10.1007/S00373-024-02803-7MaRDI QIDQ6580491zbMATH OpenFDO

Authors Houmem Belkhechine, Cherifa Ben Salha, Rim Romdhane

Publication date 29 July 2024

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

zbMATH Keywords

transversalirreduciblemodulepairingindecomposablequasi-pairing

Mathematics Subject Classification ID

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

Recommendations

• Recognizing indecomposability for tournaments
• Indecomposability and duality of tournaments
• Making a tournament indecomposable by one subtournament-reversal operation
• Tournaments with maximal decomposability
• Tournaments whose indecomposability graph admits a vertex cover of size 2.

Cites work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580491)