Bauer–Fan–Veldman circumference conjecture for 1-tough graphs
Statement
Let be a graph of order , let denote its toughness, let denote the independence number, and let be its smallest union degree of order :
For nonadjacent vertices at distance , write , and define
Let be the circumference of , namely the length of a longest cycle. Bauer–Fan–Veldman conjecture. If is a 1-tough graph with , then
This strengthens the earlier lower bound ; the intermediate bound with additive constant follows from a theorem of Hoa. The conjecture is the claim proved in the source paper.
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.