Local constraints ensuring small representing sets

P. Erdős, András Hajnal, Z. Tuza

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

A set T is said to cover a set system J if T meets all members of J. We raise the following general problem. Find relations among the natural numbers p, r, s, t, that imply the truth of the following statement: If J. is an r-uniform set system such that each of its subsystems on at most p elements can be covered with an s-element set, then J. can be covered with a t-element set. Here we investigate the case s = 1.

Original languageEnglish
Pages (from-to)78-84
Number of pages7
JournalJournal of Combinatorial Theory, Series A
Volume58
Issue number1
DOIs
Publication statusPublished - 1991

Fingerprint

Set Systems
Natural number
Subsystem
Cover
Imply
Truth

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Local constraints ensuring small representing sets. / Erdős, P.; Hajnal, András; Tuza, Z.

In: Journal of Combinatorial Theory, Series A, Vol. 58, No. 1, 1991, p. 78-84.

Research output: Contribution to journalArticle

@article{32b35eb1d1724e289f462ab72b99e7fe,
title = "Local constraints ensuring small representing sets",
abstract = "A set T is said to cover a set system J if T meets all members of J. We raise the following general problem. Find relations among the natural numbers p, r, s, t, that imply the truth of the following statement: If J. is an r-uniform set system such that each of its subsystems on at most p elements can be covered with an s-element set, then J. can be covered with a t-element set. Here we investigate the case s = 1.",
author = "P. Erdős and Andr{\'a}s Hajnal and Z. Tuza",
year = "1991",
doi = "10.1016/0097-3165(91)90074-Q",
language = "English",
volume = "58",
pages = "78--84",
journal = "Journal of Combinatorial Theory - Series A",
issn = "0097-3165",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - Local constraints ensuring small representing sets

AU - Erdős, P.

AU - Hajnal, András

AU - Tuza, Z.

PY - 1991

Y1 - 1991

N2 - A set T is said to cover a set system J if T meets all members of J. We raise the following general problem. Find relations among the natural numbers p, r, s, t, that imply the truth of the following statement: If J. is an r-uniform set system such that each of its subsystems on at most p elements can be covered with an s-element set, then J. can be covered with a t-element set. Here we investigate the case s = 1.

AB - A set T is said to cover a set system J if T meets all members of J. We raise the following general problem. Find relations among the natural numbers p, r, s, t, that imply the truth of the following statement: If J. is an r-uniform set system such that each of its subsystems on at most p elements can be covered with an s-element set, then J. can be covered with a t-element set. Here we investigate the case s = 1.

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

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

U2 - 10.1016/0097-3165(91)90074-Q

DO - 10.1016/0097-3165(91)90074-Q

M3 - Article

AN - SCOPUS:0009890598

VL - 58

SP - 78

EP - 84

JO - Journal of Combinatorial Theory - Series A

JF - Journal of Combinatorial Theory - Series A

SN - 0097-3165

IS - 1

ER -