ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let rGr_G denote the fraction of pairs of vertices of GG that are connected by a Hamiltonian path. Equivalently, if GG has order nn, define

rG=max⁡{k(n2)  |  G is k-pair strung},r_G = \max\left\{\frac{k}{\binom{n}{2}}\;\middle|\;G\text{ is }k\text{-pair strung}\right\},

where GG is kk-pair strung when kk pairs of vertices can be connected by a Hamiltonian path. The conjecture. For every ϵ>0\epsilon>0, there exists a graph GG such that

rG>1−ϵ.r_G>1-\epsilon.

The conjecture predicts graphs in which an arbitrarily large fraction of vertex pairs are connected by Hamiltonian paths, despite the broader discussion concerning non-Hamiltonian graphs. The paper describes constructions whose corresponding fractions approach 4/54/5 and 6/76/7; finding graphs with arbitrarily large H-path connected edge sets would establish the stated bound.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.