Matricial characterization of tournaments with maximum number of diamonds
From MaRDI portal
Publication:2297718
DOI10.1016/j.disc.2019.111699zbMath1433.05133arXiv1906.04672OpenAlexW2982122603MaRDI QIDQ2297718
Soufiane Lakhlifi, Abderrahim Boussaïri, Mohamed Zaidi, Wiam Belkouche
Publication date: 20 February 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.04672
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Axioms and hulls
- Sur la répartition des diamants dans un tournoi. (On the repartition of diamonds in a tournament).
- Two-graphs and skew two-graphs in finite geometries
- Tournaments, 4-uniform hypergraphs, and an exact extremal result
- Determinantenabschätzungen für binäre Matrizen. (Estimation of determinants for binary matrices)
- On Skew E-W Matrices
- DIRECTED SIMPLICES IN HIGHER ORDER TOURNAMENTS
- On (−1, 1)-Matrices of Skew Type with the Maximal Determinant and Tournaments
- Orbits of Permutation Groups on Unordered Sets, II
- Tournaments whose Subtournaments are Irreducible or Transitive
- LA RECONSTRUCTION DES TOURNOIS SANS DIAMANT
- Symmetric and Skew-Symmetric {0,±1}-Matrices with Large Determinants
- Determinants of the Tournaments
- Countable Homogeneous Tournaments
- On Hadamard's inequality for the determinants of order non-divisible by 4
- Unifying Two Graph Decompositions with Modular Decomposition
This page was built for publication: Matricial characterization of tournaments with maximum number of diamonds
