10 Lectures and 42 Open Problems — Maximum and minimum bisections on random regular graphs
Statement
Given a -regular graph on nodes . Let and denote, respectively, the size of its largest and smallest bisection. Is it true that for every , where is a term that goes to zero as grows?
Record
- Source
- 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.