Log-convexity conjecture for bipartite graphical degree-sequence counts
For each positive integer , let denote the number of bipartite graphical degree sequences on two parts of size , written as vertices. Log-convexity conjecture. The sequence is log-convex as a function of , that is, for all relevant , . If proved, this would yield a slightly stronger counting result for bipartite degree sequences admitting rapidly mixing Markov-chain processes; the source gives no resolution of the conjecture.
References
2 papers in this index state this conjecture (2014–2016). The statement above is taken from the most recent of them; the others are arXiv:1407.1968.
Source: Péter L. Erdős, István Miklós and Zoltán Toroczkai, “New classes of degree sequences with fast mixing swap Markov chain sampling”, arXiv:1601.08224 (2016).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.