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 orie...
Main Author: | Benjamin Iriarte |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2014-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2455/pdf |
Similar Items
-
(k − 2)-linear connected components in hypergraphs of rank k
by: Florian Galliot, et al.
Published: (2023-11-01) -
On Kerov polynomials for Jack characters (extended abstract)
by: Valentin Féray, et al.
Published: (2013-01-01) -
Application of graph combinatorics to rational identities of type $A^\ast$
by: Adrien Boussicault, et al.
Published: (2009-01-01) -
Finite Eulerian posets which are binomial or Sheffer
by: Hoda Bidkhori
Published: (2011-01-01) -
Colouring random geometric graphs
by: Colin J. H. McDiarmid, et al.
Published: (2005-01-01)