Directed graphs as unions of partial orders

Peter C. Fishburn, Joel Spencer

Research output: Contribution to journalArticle

Abstract

The index of an irreflexive binary relation R is the smallest cardinal number σ(R) such that R equals the union of σ(R) partial orders. With s(n) the largest index for an R defined on n points, it is shown that s(n)/log2 n→1 as n →∞. The index function is examined for symmetric R’s and almost transitive R’s, and a characterization for σ(R)≦2 is presented. It is shown also that inf{n:s(n)>3}≦13, but the exact value of inf {n:s(n)>3} is presently unknown.

Original languageEnglish (US)
Pages (from-to)149-161
Number of pages13
JournalPacific Journal of Mathematics
Volume39
Issue number1
StatePublished - 1971

Fingerprint

Partial Order
Directed Graph
Union
Irreflexive
Cardinal number
Binary relation
Unknown

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Directed graphs as unions of partial orders. / Fishburn, Peter C.; Spencer, Joel.

In: Pacific Journal of Mathematics, Vol. 39, No. 1, 1971, p. 149-161.

Research output: Contribution to journalArticle

Fishburn, Peter C. ; Spencer, Joel. / Directed graphs as unions of partial orders. In: Pacific Journal of Mathematics. 1971 ; Vol. 39, No. 1. pp. 149-161.
@article{11d4342f53114275a416d59147818442,
title = "Directed graphs as unions of partial orders",
abstract = "The index of an irreflexive binary relation R is the smallest cardinal number σ(R) such that R equals the union of σ(R) partial orders. With s(n) the largest index for an R defined on n points, it is shown that s(n)/log2 n→1 as n →∞. The index function is examined for symmetric R’s and almost transitive R’s, and a characterization for σ(R)≦2 is presented. It is shown also that inf{n:s(n)>3}≦13, but the exact value of inf {n:s(n)>3} is presently unknown.",
author = "Fishburn, {Peter C.} and Joel Spencer",
year = "1971",
language = "English (US)",
volume = "39",
pages = "149--161",
journal = "Pacific Journal of Mathematics",
issn = "0030-8730",
publisher = "University of California, Berkeley",
number = "1",

}

TY - JOUR

T1 - Directed graphs as unions of partial orders

AU - Fishburn, Peter C.

AU - Spencer, Joel

PY - 1971

Y1 - 1971

N2 - The index of an irreflexive binary relation R is the smallest cardinal number σ(R) such that R equals the union of σ(R) partial orders. With s(n) the largest index for an R defined on n points, it is shown that s(n)/log2 n→1 as n →∞. The index function is examined for symmetric R’s and almost transitive R’s, and a characterization for σ(R)≦2 is presented. It is shown also that inf{n:s(n)>3}≦13, but the exact value of inf {n:s(n)>3} is presently unknown.

AB - The index of an irreflexive binary relation R is the smallest cardinal number σ(R) such that R equals the union of σ(R) partial orders. With s(n) the largest index for an R defined on n points, it is shown that s(n)/log2 n→1 as n →∞. The index function is examined for symmetric R’s and almost transitive R’s, and a characterization for σ(R)≦2 is presented. It is shown also that inf{n:s(n)>3}≦13, but the exact value of inf {n:s(n)>3} is presently unknown.

UR - http://www.scopus.com/inward/record.url?scp=84972565031&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84972565031&partnerID=8YFLogxK

M3 - Article

VL - 39

SP - 149

EP - 161

JO - Pacific Journal of Mathematics

JF - Pacific Journal of Mathematics

SN - 0030-8730

IS - 1

ER -