Pith. sign in

REVIEW 4 cited by

The uniform Tur\'an density of large stars

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

arxiv 2409.03699 v1 pith:WAEOUH7G submitted 2024-09-05 math.CO

classification math.CO
keywords densityuniformlargestarsasymptoticallyconstructionfraclower
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We asymptotically resolve the the uniform Tur\'an density problem for the large stars. In particular, we show that the uniform Tur\'an density of the $k$-star $S_k$ is $\frac{k^2-5k+7}{(k-1)^2}$ for $k\ge 48$, matching a lower construction by Reiher, R\"odl and Schacht.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On possible uniform Tur\'an densities

    math.CO 2025-04 conditional novelty 8.0 of 10

    The set of uniform Turan densities of finite families contains every palette Lagrangian, and therefore contains irrational numbers.

  2. Finite palette endpoints and degree-square Tur\'an problems

    math.CO 2026-06 unverdicted novelty 7.0 of 10

    Proves exact degree-square Turán formulas for tournament palettes via auxiliary digraphs and majorization, yielding finite 3-graphs with uniform densities approaching 1/3.

  3. Uniform Tur\'an density beyond 3-graphs

    math.CO 2025-08 conditional novelty 7.0 of 10

    For every r≥3 there exist r-uniform hypergraphs whose uniform Turán density is 1/4, and others whose uniform Turán density is binom(r,2)^{-binom(r,2)}; the r≥5 cases are the first explicit non-zero values.

  4. Uniform Tur\'an density -- palette classification

    math.CO 2025-05 conditional novelty 7.0 of 10

    A hypergraph exists that is colorable by each of given palettes but not by an additional palette exactly when no palette homomorphism exists to that additional palette or its inverse.

Pith tools