One application is an important special case of a famous open question of Lovász [17] from 1969 concerning the Hamiltonicity of a certain class of well-behaved graphs (see…
Statement
One application is an important special case of a famous open question of Lovász [17] from 1969 concerning the Hamiltonicity of a certain class of well-behaved graphs (see e.g., [10] and its references for more background on the problem). Since Cayley graphs are vertex-transitive and none of the five known exceptions in Lovász’s conjecture is a Cayley graph, the conjecture in particular includes the following, which was asked much earlier in 1959 by Rapaport-Strasser [21]. Therefore, a particular instance of Conjecture 6 is to show that ΓpG, Sq is almost surely Hamiltonian, which itself is also a conjecture of Pak and Radoičić [19]. The report passage is retained verbatim as the relevant context for this extracted problem.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.