Graph Orientations and Linear Extensions

References

• Bollobás B (1988) The chromatic number of random graphs. Combinatorica 8(1):49–55.Crossref, Google Scholar
• Chvátal V (1975) On certain polytopes associated with graphs. J. Combinatorial Theory, Ser. B 18(2):138–154.Crossref, Google Scholar
• Csiszár I, Körner J, Lovasz L, Marton K, Simonyi G (1990) Entropy splitting for antiblocking corners and perfect graphs. Combinatorica 10(1):27–40.Crossref, Google Scholar
• Edelman P, Hibi T, Stanley RP (1989) A recurrence for linear extensions. Order 6(1):15–18.Crossref, Google Scholar
• Ford LR Jr, Fulkerson DR (2010) Flows in Networks. Princeton Landmarks in Mathematics and Physics (Princeton University Press, Princeton, NJ).Google Scholar
• Gallai T (1967) Transitiv orientierbare graphen. Acta Mathematica Hungarica 18(1):25–66.Crossref, Google Scholar
• Grimmett GR, McDiarmid CJ (1975) On colouring random graphs. Math. Proc. Cambridge Philos. Soc. Vol. 77-02 (Cambridge University Press, New York), 313–324.Crossref, Google Scholar
• Kahn J, Kim JH (1995) Entropy and sorting. J. Comput. System Sci. 51(3):390–399.Crossref, Google Scholar
• Klivans CJ, Swartz E (2011) Projection volumes of hyperplane arrangements. Discrete Comput. Geometry 46(3):417–426.Crossref, Google Scholar
• Körner J (1973) Coding of an information source having ambiguous alphabet and the entropy of graphs. Trans. 6th Prague Conf. Inform. Theory (Academia, Prague), 411–425.Google Scholar
• McDiarmid C (1990) On the chromatic number of random graphs. Random Structures and Algorithms 1(4):435–442.Crossref, Google Scholar
• Saito K (2007) Principal γ-cone for a tree. Adv. Math. 212(2):645–668.Crossref, Google Scholar
• Stachowiak G (1988) The number of linear extensions of bipartite graphs. Order 5(3):257–259.Crossref, Google Scholar
• Stanley RP (1986) Two poset polytopes. Discrete Comput. Geometry 1(1):9–23.Crossref, Google Scholar