Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. On the Boolean dimen ...
Article

On the Boolean dimension of a graph and other related parameters

Maurice Pouzet (1) (2) (3), Hamza Si Kaddour (1) (2) (3), Bhalchandra Thatte (4) (5)
(1) Université Claude Bernard Lyon 1
(2) Institut Camille Jordan
(3) Combinatoire, théorie des nombres
(4) Universidade Federal de Minas Gerais = Federal University of Minas Gerais [Belo Horizonte, Brazil]
(5) Universidade Federal de Minas Gerais = Federal University of Minas Gerais
Download article
Open on HAL
Submitted on
May 3, 2021
Accepted on
August 2, 2022
Published on
September 23, 2022
Last modified on
April 1, 2025
Special issue 23
vol. 23:2, special issue in honour of Maurice Pouzet
Special issues
DOI
10.46298/dmtcs.7437
License
https://about.hal.science/hal-authorisation-v1
Indicators
1099
Views
1123
Downloads

On the Boolean dimension of a graph and other related parameters

Maurice Pouzet (1) (2) (3), Hamza Si Kaddour (1) (2) (3), Bhalchandra Thatte (4) (5)
(1) Université Claude Bernard Lyon 1
(2) Institut Camille Jordan
(3) Combinatoire, théorie des nombres
(4) Universidade Federal de Minas Gerais = Federal University of Minas Gerais [Belo Horizonte, Brazil]
(5) Universidade Federal de Minas Gerais = Federal University of Minas Gerais
Abstract
We present the Boolean dimension of a graph, we relate it with the notions of inner, geometric and symplectic dimensions, and with the rank and minrank of a graph. We obtain an exact formula for the Boolean dimension of a tree in terms of a certain star decomposition. We relate the Boolean dimension with the inversion index of a tournament.
Keywords
  • 06A6, 06F15
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • graphs
  • Boolean sum
  • symplectic dimension
  • geometric dimension
  • tournaments
  • inversion index
Cited by

Source: OpenCitations

  • Relaxations and Exact Solutions to Quantum Max Cut via the Algebraic Structure of Swap Operators

    Quantum

    Authors : Adam Bene Watts ORCID, Anirban Chowdhury ORCID, Aidan Epperly, J. William Helton, Igor Klep ORCID

    Journal reference : Volume 8, 2024, pp. 1352

    DOI : 10.22331/q-2024-05-22-1352
  • On the minimum number of inversions to make a digraph k-(arc-)strong

    Journal of Graph Theory

    Authors : Julien Duron, Frédéric Havet ORCID, Florian Hörsch ORCID, Clément Rambaud

    Journal reference : Volume , 2023, pp. 386-392

    DOI : 10.5817/cz.muni.eurocomb23-054
Preview
Loading PDF preview...