Improving the $$\frac{1}{3} - \frac{2}{3}$$ Conjecture for Width Two Posets
暂无分享,去创建一个
[1] Marcin Peczarski. The Worst Balanced Partially Ordered Sets—Ladders with Broken Rungs , 2019, Exp. Math..
[2] S. G. Hoggar. Chromatic polynomials and logarithmic concavity , 1974 .
[3] PETER C. FISHBURN. On linear extension majority graphs of partial orders , 1976, J. Comb. Theory, Ser. B.
[4] Jean Cardinal,et al. Sorting under partial information (without the ellipsoid algorithm) , 2013, Comb..
[5] Imed Zaguia. The 1/3-2/3 Conjecture for Ordered Sets whose Cover Graph is a Forest , 2019, Order.
[6] Jeff Kahn,et al. Entropy and sorting , 1992, STOC '92.
[7] Stefan Felsner,et al. Balancing pairs and the cross product conjecture , 1995 .
[8] Michael L. Fredman,et al. How Good is the Information Theory Bound in Sorting? , 1976, Theor. Comput. Sci..
[9] Marcin Peczarski,et al. The Gold Partition Conjecture for 6-Thin Posets , 2008, Order.
[10] Samuel Fiorini,et al. Poset Entropy Versus Number of Linear Extensions: The Width-2 Case , 2014, Order.
[11] Federico Poloni. Of Note , 2009 .
[12] Graham R. Brightwell,et al. Balanced pairs in partial orders , 1999, Discret. Math..
[13] Bruce E. Sagan,et al. On the 1/3–2/3 Conjecture , 2018, Order.
[14] Nathan Linial,et al. The Information-Theoretic Bound is Good for Merging , 1984, SIAM J. Comput..
[15] J. Kahn,et al. Balancing poset extensions , 1984 .
[16] Evan Chen. A Family of Partially Ordered Sets with Small Balance Constant , 2018, Electron. J. Comb..
[17] Graham Brightwell. Semiorders and the 1/3–2/3 conjecture , 1989 .
[18] M. Aigner. A note on merging , 1985, Order.
[19] Imed Zaguia. The 1/3-2/3 Conjecture for N-Free Ordered Sets , 2012, Electron. J. Comb..
[20] S. S. Kislitsyn. A finite partially ordered set and its corresponding set of permutations , 1968 .
[21] Peter C. Fishburn,et al. Balance theorems for height-2 posets , 1992 .