Pith. sign in

REVIEW 1 cited by

On powers of Hamilton cycles in Ramsey-Tur\'{a}n Theory

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 2305.17360 v1 pith:GX7V4HZM submitted 2023-05-27 math.CO

classification math.CO
keywords alphaeveryhamiltonasymptoticallycaseconditionconjecturedcontains
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We prove that for $r\in \mathbb{N}$ with $r\geq 2$ and $\mu>0$, there exist $\alpha>0$ and $n_{0}$ such that for every $n\geq n_{0}$, every $n$-vertex graph $G$ with $\delta(G)\geq \left(1-\frac{1}{r}+\mu\right)n$ and $\alpha(G)\leq \alpha n$ contains an $r$-th power of a Hamilton cycle. We also show that the minimum degree condition is asymptotically sharp for $r=2, 3$ and the $r=2$ case was recently conjectured by Staden and Treglown.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Ramsey--Dirac theory for bounded degree hypertrees

    math.CO 2024-11 conditional novelty 6.0 of 10

    If an n-vertex r-uniform hypergraph has high minimum degree and no large empty r-partite subhypergraph, it contains every n-vertex bounded-degree linear hypertree.

Pith tools