Erratum to "Facets of the linear ordering polytope: A unification for the fence family through weighted graphs". [Journal of Mathematical Psychology 50 (2006) 251-262] (DOI:10.1016/j.jmp.2006.01.001);Facets of the linear ordering polytope: A unification for the fence family through weighted graphs

Journal of Mathematical Psychology

Volumn 50, Issue 3, 2006, Pages 251-262

  Doignon, Jean Paul ^a   Fiorini, Samuel ^a,b   Joret, Gwenaël ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b HEC MONTRÉAL   (Canada)

Author keywords

Binary choice polytope; Facet defining inequality; Fence inequality; Linear ordering polytope; Stability critical graph

Indexed keywords

EID: 33747175939     PISSN: 00222496     EISSN: 10960880     Source Type: Journal    
DOI: 10.1016/j.jmp.2007.08.001     Document Type: Erratum

References (55)

1. Andrásfai, B. (1967). On critical graphs. In Theory of graphs (International symposium, Rome, 1966) (pp. 9-19). New York: Gordon & Breach.
2. Beineke L.W., Harary F., and Plummer M. On the critical lines of a graph. Pacific Journal of Mathematics 22 (1967) 205-212
3. Block H.D., and Marschak J. Random orderings and stochastic theories of responses. In: Olkin I., Ghurye S., Hoeffding W., Madow W., and Mann H. (Eds). Contributions to probability and statistics (1960), Stanford University Press, Stanford, CA 97-132
4. Bolotashvili, G. (1987). A class of facets of the permutation polytope and a method for constructing facets of the permutation polytope. Technical report 3403-B87 and N3405-B87, VINITI (in Russian).
5. Bolotashvili G., Kovalev M., and Girlich E. New facets of the linear ordering polytope. SIAM Journal on Discrete Mathematics 12 (1999) 326-336
6. Borndörfer R., and Weismantel R. Set packing relaxations of some integer programs. Mathematical Programming 88 Series A (2000) 425-450
7. Christophe J., Doignon J.-P., and Fiorini S. Counting biorders. Journal of Integer Sequences 6 article 03.4.3 (2003) 10 pp.
8. Christophe J., Doignon J.-P., and Fiorini S. The biorder polytope. Order 21 (2004) 61-82
9. Cohen, M., & Falmagne, J.-C. (1978). Random scale representation of binary choice probabilities: A counterexample to a conjecture of Marschak. Technical report, Department of Psychology, New York University, New York, unpublished manuscript.
10. Cohen M., and Falmagne J.-C. Random utility representation of binary choice probabilities: A new class of necessary conditions. Journal of Mathematical Psychology 34 (1990) 88-94
11. Diestel, R. (2005). Graph theory. Graduate texts in mathematics (3rd ed., Vol. 173). Berlin: Springer.
12. Doignon J.-P., Ducamp A., and Falmagne J.-C. On realizable biorders and the biorder dimension of a relation. Journal of Mathematical Psychology 28 (1984) 73-109
13. Ducamp A., and Falmagne J.C. Composite measurement. Journal of Mathematical Psychology 6 (1969) 359-390
14. Erdo{combining double acute accent}s P., and Gallai T. On the minimal number of vertices representing the edges of a graph. A Magyar Tudományos Akadémia Matematikai és Fizikai Tudományok Osztályának Közleményei 6 (1961) 181-203
15. Erdo{combining double acute accent}s P., Hajnal A., and Moon J.W. A problem in graph theory. The American Mathematical Monthly 71 (1964) 1107-1110
16. Falmagne J.-C. A representation theorem for finite random scale systems. Journal of Mathematical Psychology 18 (1978) 52-72
17. Falmagne, J.-C. (1979). Errata: "A representation theorem for finite random scale systems" (Journal of Mathematical Psychology, 18(1) (1978) 52-72). Journal of Mathematical Psychology, 19, 219.
18. Fiorini S. Determining the automorphism group of the linear ordering polytope. Discrete Applied Mathematics 112 (2001) 121-128
19. Fiorini S. A short proof of a theorem of Falmagne. Journal of Mathematical Psychology 48 (2004) 80-82
20. Fiorini, S. (2006a). How to recycle your facets. Discrete Optimization, to appear.
21. Fiorini, S. (2006b). { 0, frac(1, 2) }-cuts and the linear ordering problem: Surfaces that define facets. SIAM Journal on Discrete Mathematics, conditionally accepted for publication.
22. Fishburn P.C. Binary probabilities induced by rankings. SIAM Journal on Discrete Mathematics 3 (1990) 478-488
23. Gilboa I. A necessary but insufficient condition for the stochastic binary choice problem. Journal of Mathematical Psychology 34 (1990) 371-392
24. Grötschel M., Jünger M., and Reinelt G. Facets of the linear ordering polytope. Mathematical Programming 33 (1985) 43-60
25. Grötschel M., Jünger M., and Reinelt G. On the acyclic subgraph polytope. Mathematical Programming 33 (1985) 28-42
26. Guilbaud, G. (1953). Sur une difficulté de la théorie du risque. In Econométrie. Colloques Internationaux du Centre National de la Recherche Scientifique (Vol. 1952(40), pp. 19-25; discussion, pp. 25-28). Paris: Centre de la Recherche Scientifique.
27. Guttman L. A basis for scaling quantitative data. American Sociological Review 9 (1944) 139-150
28. Hajnal A. A theorem on k-saturated graphs. Canadian Journal of Mathematics 17 (1965) 720-724
29. Harary F., and Plummer M.D. On indecomposable graphs. Canadian Journal of Mathematics 19 (1967) 800-809
30. Karp, R. M. (1972). Reducibility among combinatorial problems. In Complexity of computer computations (Proceedings of the symposium, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1972) (pp. 85-103). New York: Plenum.
31. Koppen M. Random utility representation of binary choice probabilities. In: Doignon J.-P., and Falmagne J.-C. (Eds). Mathematical psychology: current developments (1991), Springer, New York 181-201
32. Koppen M. Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions. Journal of Mathematical Psychology 39 (1995) 21-39
33. Leung J., and Lee J. More facets from fences for linear ordering and acyclic subgraph polytopes. Discrete Applied Mathematics 50 (1994) 185-200
34. Lipták L., and Lovász L. Facets with fixed defect of the stable set polytope. Mathematical Programming 88 Series A (2000) 33-44
35. Lipták L., and Lovász L. Critical facets of the stable set polytope. Combinatorica 21 (2001) 61-88
36. Lovász, L. (1978). Some finite basis theorems on graph theory. In A. Hajnal, V. Sós (Eds.), Combinatorics (Proceedings of the fifth Hungarian colloquium, Keszthely, 1976). Colloquia Mathematica Societatis János Bolyai (Vol. 18, pp. 717-729). Amsterdam: North-Holland.
37. Lovász, L., 1993. Combinatorial problems and exercises (2nd ed.). Amsterdam: North-Holland.
38. Lovász, L., & Plummer, M. D. (1986). Matching theory. North-Holland mathematics studies (Vol. 121). Amsterdam: North-Holland; Annals of Discrete Mathematics, 29.
39. McLennan A. Binary stochastic choice. In: Chipman J., McFadden D., and Richter M. (Eds). Preferences, uncertainty, and optimality (1990), Westview Press, Boulder, CO 187-202
40. Megiddo N. Mixtures of order matrices and generalized order matrices. Discrete Mathematics 19 (1977) 177-181
41. Plummer M.D. On a family of line-critical graphs. Monatshefte für Mathematik 71 (1967) 40-48
42. Riguet J. Les relations de Ferrers. Comptes Rendus des Séances de l'Académie des Sciences (Paris) 232 (1951) 1729-1730
43. 4. Journal of Combinatorial Theory-Series B 59 (1993) 74-84
44. Sewell E.C., and Trotter Jr. L.E. Stability critical graphs and ranks facets of the stable set polytope. Discrete Mathematics 147 (1995) 247-255
45. Suck R. Geometric and combinatorial properties of the polytope of binary choice probabilities. Mathematical Social Sciences 23 (1992) 81-102
46. Surányi L. Large α-critical graphs with small deficiency: On-line-critical graphs, II. Studia Scientiarum Mathematicarum Hungarica 10 (1975) 397-412 1978
47. Surányi, L. (1975b). On line critical graphs. In Infinite and finite sets (Colloquium, Keszthely, 1973; dedicated to P. Erdös on his 60th birthday) (Vol. III); Colloquia Mathematica Societatis János Bolyai (Vol. 10, pp. 1411-1444). Amsterdam: North-Holland.
48. Surányi, L. (1978). A note on a conjecture of Gallai concerning α-critical graphs. In Combinatorics (Proceedings of the fifth Hungarian Colloquium, Keszthely, 1976) (Vol. II); Colloquia Mathematica Societatis János Bolyai (Vol. 18, pp. 1065-1074). Amsterdam: North-Holland.
49. Surányi L. On a generalization of line-critical graphs. Discrete Mathematics 30 (1980) 277-287
50. Wessel, W. (1968). Eine Methode zur Konstruktion von kanten-p-kritischen Graphen. In H. Sachs, H.-J. Voss, & H. Walther (Eds.), Beiträge zur Graphentheorie (kolloquium, Manebach, 1967) (pp. 207-210). Leipzig: Teubner.
51. Wessel W. Kanten-kritische Graphen mit der Zusammenhangszahl 2. Manuscripta Mathematica 2 (1970) 309-334
52. Wessel, W. (1970b). On the problem of determining whether a given graph is edgecritical or not. In P. Erdös, A. Rényi, V. Sós (Eds.), Combinatorial theory and its applications, III (Proceedings of the colloquium, Balatonfüred, 1969) (pp. 1123-1139). Amsterdam: North-Holland.
53. Wessel W. A first family of edge-critical wheels. Periodica Mathematica Hungarica 6 (1975) 229-233
54. Wessel, W. (1978). A second family of edge-critical wheels. In Combinatorics (Proceedings of the fifth Hungarian colloquium, Keszthely, 1976) (Vol. II); Colloquia Mathematica Societatis János Bolyai (Vol. 18, pp. 1123-1145). Amsterdam: North-Holland.
55. Zhu, Q. C. (1989). The structure of α-critical graphs with | V ( G ) | - 2 α ( G ) = 3. In Graph theory and its applications: East and West (Jinan, 1986); Annals of the New York Academy of Sciences (Vol. 576, pp. 716-722). New York: New York Academy of Sciences.