REVIEW 1 cited by
A problem of Erd\H{o}s and Hajnal on paths with equal-degree endpoints
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
Signed reviews
abstract
We address a problem posed by Erd\H{o}s and Hajnal in 1991, proving that for all $n \geq 600$, every $(2n+1)$-vertex graph with at least $n^2 + n + 1$ edges contains two vertices of equal degree connected by a path of length three. The complete bipartite graph $K_{n,n+1}$ demonstrates that this edge bound is sharp. We further establish an analogous result for graphs with even order and investigate several related extremal problems.
Forward citations
Cited by 1 Pith paper
-
A complement of the Erd\H{o}s-Hajnal problem on paths with equal-degree endpoints
For every n at least 2, every (2n+1)-vertex graph with at least n^2+n+1 edges contains two equal-degree vertices joined by a path of length three, with K_{n,n+1} as the unique extremal graph.
Discussion (0). Continue with ORCID to comment.