REVIEW 2 cited by
The Brown-Erd\H{o}s-S\'os Conjecture for hypergraphs of large uniformity
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We prove the well-known Brown-Erd\H{o}s-S\'os Conjecture for hypergraphs of large uniformity in the following form: any dense linear $r$-graph $G$ has $k$ edges spanning at most $(r-2)k+3$ vertices, provided the uniformity $r$ of $G$ is large enough given the linear density of $G$, and the number of vertices of $G$ is large enough given $r$ and $k$.
Forward citations
Cited by 2 Pith papers
-
Erd\H{o}s meets Nash-Williams
Every sufficiently large triangle-divisible graph with minimum degree at least (7+√21)/14 + epsilon has a triangle decomposition with arbitrarily large girth.
-
On problems in extremal multigraph theory
The paper proves asymptotic and exact extremal densities for (s,q)-multigraphs in the large- and small-multiplicity regimes.
Discussion (0). Sign in to comment.