The weighted tree-indicator approximation conjecture for uniform graphs with a given degree sequence
Statement
Let be a strict graphic sequence of type . Let be the set of graphs with degree sequence , and let be uniformly distributed on . For a tree and an injective map , define
Define
where , , and are defined in the paper, and is the corresponding independent-edge probability. Weighted tree-indicator approximation conjecture. Then
The claim is proposed as the analogue, for the uniform fixed-degree-sequence model, of the corresponding estimate for the independent-edge model. The surrounding discussion states that the paper proves this conjecture in several regimes, including very sparse, dense, and bipartite graphs, but the general assertion is presented as a conjecture.
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.