1998
DOI: 10.1007/pl00009819
|View full text |Cite
|
Sign up to set email alerts
|

On Large Systems of Sets with No Large Weak Δ-subsystems

Abstract: A family of sets is called a weak ∆-system if the cardinality of the intersection of any two sets is the same. We elaborate a construction by Rödl and Thoma [9] and show that for large n, there exists a family F of subsets of {1, . . ., n} without weak ∆-systems of size 3 with |F| ≥ 2 c(n log n) 1/3 .

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2000
2000
2023
2023

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…4 log log n . The the current best lower bound, due to Kostochka and Rödl [11] (which improved upon [16]), is…”
Section: Introductionmentioning
confidence: 99%
“…4 log log n . The the current best lower bound, due to Kostochka and Rödl [11] (which improved upon [16]), is…”
Section: Introductionmentioning
confidence: 99%