On the number of edges of comparability and incomparability graphs - Université Jean Moulin Lyon 3 Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2020

On the number of edges of comparability and incomparability graphs

Résumé

Since the 1990s, as we know, comparability and incomparability graphs find use in experimental sciences, particularly in chemistry and physical chemistry as well as in statistical physics, to characterize molecular properties, order isomers or specify the topology of certain structures such as chemical structures. In this mostly historical article, readable by a non-specialist, we recall first some basic notions of graph theory. Then, we define the notions of comparability and incomparability graphs of a poset, summarize the recent advances on the question and compute the number of edges of these graphs, using in particular Boolean representation of posets. We also give a special method in the case of Boolean lattices.
Fichier principal
Vignette du fichier
Graph-incomp.pdf (371.85 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02972652 , version 1 (20-10-2020)

Identifiants

  • HAL Id : hal-02972652 , version 1

Citer

Daniel Parrochia. On the number of edges of comparability and incomparability graphs. 2020. ⟨hal-02972652⟩
39 Consultations
276 Téléchargements

Partager

Gmail Facebook X LinkedIn More