BOUNDS ON THRESHOLD DIMENSION AND DISJOINT THRESHOLD COVERINGS.

P. Erdős, E. Ordman, Y. Zalcstein

Research output: Conference contribution

Abstract

The threshold dimension of a graph G is the smallest number of threshold graphs needed to cover the edges of G. If t(n) is the greatest threshold dimension of any graph of n vertices, we show that for some constant c, n minus c n log n less than t(n) less than n minus n plus 1 We establish the same bounds for edge-disjoint coverings of graphs by threshold graphs. The results have applications to manipulating systems of simultaneous linear inequalities and to space bounds for synchronization problems.

Original languageEnglish
Title of host publicationUnknown Host Publication Title
PublisherACM
Pages422
Number of pages1
ISBN (Print)0897911504
Publication statusPublished - 1985

Fingerprint

Synchronization

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Erdős, P., Ordman, E., & Zalcstein, Y. (1985). BOUNDS ON THRESHOLD DIMENSION AND DISJOINT THRESHOLD COVERINGS. In Unknown Host Publication Title (pp. 422). ACM.

BOUNDS ON THRESHOLD DIMENSION AND DISJOINT THRESHOLD COVERINGS. / Erdős, P.; Ordman, E.; Zalcstein, Y.

Unknown Host Publication Title. ACM, 1985. p. 422.

Research output: Conference contribution

Erdős, P, Ordman, E & Zalcstein, Y 1985, BOUNDS ON THRESHOLD DIMENSION AND DISJOINT THRESHOLD COVERINGS. in Unknown Host Publication Title. ACM, pp. 422.
Erdős P, Ordman E, Zalcstein Y. BOUNDS ON THRESHOLD DIMENSION AND DISJOINT THRESHOLD COVERINGS. In Unknown Host Publication Title. ACM. 1985. p. 422
Erdős, P. ; Ordman, E. ; Zalcstein, Y. / BOUNDS ON THRESHOLD DIMENSION AND DISJOINT THRESHOLD COVERINGS. Unknown Host Publication Title. ACM, 1985. pp. 422
@inproceedings{02cfee6894c3410dbe12238fa61299e0,
title = "BOUNDS ON THRESHOLD DIMENSION AND DISJOINT THRESHOLD COVERINGS.",
abstract = "The threshold dimension of a graph G is the smallest number of threshold graphs needed to cover the edges of G. If t(n) is the greatest threshold dimension of any graph of n vertices, we show that for some constant c, n minus c n log n less than t(n) less than n minus n plus 1 We establish the same bounds for edge-disjoint coverings of graphs by threshold graphs. The results have applications to manipulating systems of simultaneous linear inequalities and to space bounds for synchronization problems.",
author = "P. Erdős and E. Ordman and Y. Zalcstein",
year = "1985",
language = "English",
isbn = "0897911504",
pages = "422",
booktitle = "Unknown Host Publication Title",
publisher = "ACM",

}

TY - GEN

T1 - BOUNDS ON THRESHOLD DIMENSION AND DISJOINT THRESHOLD COVERINGS.

AU - Erdős, P.

AU - Ordman, E.

AU - Zalcstein, Y.

PY - 1985

Y1 - 1985

N2 - The threshold dimension of a graph G is the smallest number of threshold graphs needed to cover the edges of G. If t(n) is the greatest threshold dimension of any graph of n vertices, we show that for some constant c, n minus c n log n less than t(n) less than n minus n plus 1 We establish the same bounds for edge-disjoint coverings of graphs by threshold graphs. The results have applications to manipulating systems of simultaneous linear inequalities and to space bounds for synchronization problems.

AB - The threshold dimension of a graph G is the smallest number of threshold graphs needed to cover the edges of G. If t(n) is the greatest threshold dimension of any graph of n vertices, we show that for some constant c, n minus c n log n less than t(n) less than n minus n plus 1 We establish the same bounds for edge-disjoint coverings of graphs by threshold graphs. The results have applications to manipulating systems of simultaneous linear inequalities and to space bounds for synchronization problems.

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

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

M3 - Conference contribution

AN - SCOPUS:0022231452

SN - 0897911504

SP - 422

BT - Unknown Host Publication Title

PB - ACM

ER -