Scheinerman–Ullman fractional Hamiltonicity conjecture and Devriendt's resistance-positivity conjecture
Statement
Every finite graph that is -tough is fractionally Hamiltonian. Here, is -tough if, for every vertex set with , one has , where denotes the number of connected components of . The graph is fractionally Hamiltonian if there exists a function such that and, for every nonempty proper subset , , where is the edge cut between and .
Record
- Added
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.