Graph Orientations and Linear Extensions. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2014

Graph Orientations and Linear Extensions.


Given an underlying undirected simple graph, we consider the set of all acyclic orientations of its edges. Each of these orientations induces a partial order on the vertices of our graph, and therefore we can count the number of linear extensions of these posets. We want to know which choice of orientation maximizes the number of linear extensions of the corresponding poset, and this problem is solved essentially for comparability graphs and odd cycles, presenting several proofs. We then provide an inequality for general graphs and discuss further techniques.
Fichier principal
Vignette du fichier
dmAT0181.pdf (304.54 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01207561 , version 1 (01-10-2015)



Benjamin Iriarte. Graph Orientations and Linear Extensions.. 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014), 2014, Chicago, United States. pp.945-956, ⟨10.46298/dmtcs.2455⟩. ⟨hal-01207561⟩


59 View
711 Download



Gmail Facebook Twitter LinkedIn More