betaFeedback

Reading v1View latest version

WorksMathematics

A complement of the Erdős-Hajnal problem on paths with equal-degree endpoints

Abstract

Answering a question of Erdős and Hajnal, Chen and Ma proved that for all n≥600n\geq600 every graph with 2n+12n + 1 vertices and at least n2+n+1n^2 + n+1 edges contains two vertices of equal degree connected by a path of length three. The complete bipartite graph Kn,n+1K_{n,n+1} shows that this edge bound is sharp. In this paper, we develop a novel approach to handle graphs with large equal degrees, which enables us to establish the result for all n≥2n\ge2, thereby fully resolving the problem posed by Erdős and Hajnal.

Paper details

vlnc:W_t5uqk65r
Published
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…