DOAJ Open Access 2014

Graph Orientations and Linear Extensions.

Benjamin Iriarte

Lihat Sumber DOI

Abstrak

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.

Topik & Kata Kunci

Mathematics

Penulis (1)

Benjamin Iriarte

Format Sitasi

APA MLA BibTeX

Iriarte, B. (2014). Graph Orientations and Linear Extensions.. https://doi.org/10.46298/dmtcs.2455

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.2455

Informasi Jurnal

Tahun Terbit: 2014
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.2455
Akses: Open Access ✓