2010
DOI: 10.1016/j.jctb.2009.05.005
|View full text |Cite
|
Sign up to set email alerts
|

Weak hypergraph regularity and linear hypergraphs

Abstract: We consider conditions which allow the embedding of linear hypergraphs of fixed size. In particular, we prove that any k-uniform hypergraph H of positive uniform density contains all linear k-uniform hypergraphs of a given size. More precisely, we show that for all integers k 2 and every d > 0 there exists > 0 for which the following holds: if H is a sufficiently large k-uniform hypergraph with the property that the density of H induced on every vertex subset of size n is at least d, then H contains every line… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
112
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 73 publications
(112 citation statements)
references
References 19 publications
0
112
0
Order By: Relevance
“…[5,11,32]), which is a straightforward generalization of Szemerédi's regularity lemma for graphs. This version has recently been proved [15] to be compatible (i.e., admits a counting lemma) with linear hypergraphs, i.e., those hypergraphs whose hyperedges intersect pairwise in at most one vertex. In this setting the notion of the cluster hypergraph is the same as for graphs.…”
Section: Resultsmentioning
confidence: 99%
“…[5,11,32]), which is a straightforward generalization of Szemerédi's regularity lemma for graphs. This version has recently been proved [15] to be compatible (i.e., admits a counting lemma) with linear hypergraphs, i.e., those hypergraphs whose hyperedges intersect pairwise in at most one vertex. In this setting the notion of the cluster hypergraph is the same as for graphs.…”
Section: Resultsmentioning
confidence: 99%
“…Hypergraphs with property DISC d were studied in [2,3,20] and a straightforward generalisation of Szemerédi's regularity lemma for this concept was observed to hold in [4,12,32] (see Theorem 23 below).…”
Section: Disc D (δ)mentioning
confidence: 99%
“…Moreover, the number of labeled, induced copies of K (3) 1,1,2 in H n is ∼ n 4 /64, while the "right" number would be 49n 4 /64 2 . However, it was shown in [20] that k-graphs having DISC d (δ) for sufficiently small δ must contain approximately the same number of copies of any fixed linear k-graph F as a genuine random k-graph of the same density. Here a linear k-graph F is defined as having no pair of edges which intersect in two or more vertices.…”
Section: Generalisation Of Theoremmentioning
confidence: 99%
See 1 more Smart Citation
“…In addition to the regularity lemma we need the following embedding lemma recently proved by Kohayakawa-Nagle-Rödl-Schacht [17]. Recall that a hypergraph is linear if every two edges have at most one point in common.…”
Section: Outline Of the Proofmentioning
confidence: 99%