A survey of Pfaffian orientations of graphs

International Congress of Mathematicians, ICM 2006

Volumn 3, Issue , 2006, Pages 963-984

  Thomas, Robin ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Brace; Brick; Crossing number; Dimer problem; Even directed cycle; Graph; Matching; Pfaffian orientation; P lya's permanent problem; Sign nonsingular matrix

Indexed keywords

BRACE; CROSSING NUMBER; DIMER PROBLEM; EVEN DIRECTED CYCLE; GRAPH; MATCHING; PFAFFIAN ORIENTATION; SIGN-NONSINGULAR MATRIX;

BRICK; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION;

DIRECTED GRAPHS;

EID: 84878028194     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (65)

1. Alon, N., Restricted colorings of graphs. In Surveys in Combinatorics, London Math. Soc. Lecture Note Ser. 187, Cambridge University Press, Cambridge 1993, 1-33.
2. Alon, N., and Tarsi, M., Colorings and orientations of graphs. Combinatorica 12 (1992), 125-134.
3. Birkhoff, G., Three observations on linear algebra. Univ.Nac. Tucumán. Revista A. 5 (1946), 147-151 (in Spanish).
4. Bollobás, B., Modern graph theory. Grad. Texts in Math. 184, Springer-Verlag, New York 1998.
5. Bollobás, B., and Harris, A. J., List-colorings of graphs. Graphs Combin. 1 (1985), 115-127.
6. Brualdi, R. A., and Shader, B. L., Matrices of sign-solvable linear systems. Cambridge Tracts in Math. 116, Cambridge University Press, Cambridge 1995.
7. de Carvalho, M. H., Lucchesi, C. L., and Murty, U. S. R., On a conjecture of Lovász concerning bricks. II. Bricks of finite characteristic. J. Combin. Theory B 85 (2002), 137-180.
8. de Carvalho, M. H., Lucchesi, C. L., and Murty, U. S. R., On the number of dissimilar Pfaffian orientations of graphs. Theor. Inform. Appl. 39 (2005), 93-113.
9. de Carvalho, M. H., Lucchesi, C. L., and Murty, U. S. R., How to build a brick. Discrete Math., to appear
10. Diestel, R., Graph Theory. Grad. Texts in Math. 173, Springer-Verlag, Berlin 2005.
11. Diestel, R., Jensen, T. R., Gorbunov, K. Yu., and Thomassen, C., Highly connected sets and the excluded grid theorem. J. Combin. Theory Ser. B 75 (1999), 61-73.
12. Edmonds, J., Maximum matching and a polyhedron with (0, 1) vertices. J. Res. Nat. Standards B 69 (1965), 125-130.
13. Edmonds, J., Lovász, L., and Pulleyblank, W. R., Brick decompositions and matching rank of graphs. Combinatorica 2 (1982), 247-274.
14. Ellingham, M., and Goddyn, L., List edge colourings of some 1-factorable multigraphs. Combinatorica 16 (1996), 343-352.
15. Fischer, I., and Little, C., A characterisation of Pfaffian near bipartite graphs. J. Combin. Theory Ser. B 82 (2001), 175-222.
16. Fisher, M. E., Statistical mechanics of dimers on a plane lattice. Phys. Rev. 124, 1664-1672.
17. Galluccio, A., and Loebl, M., On the theory of Pfaffian orientations I. Perfect matchings and permanents. Electron. J. Combin. 6 (1999).
18. Goddyn, L., private communication.
19. Grötschel, M., Lovász, L., and Schrijver, A., Geometric algorithms and combinatorial optimization. Algorithms Combin. 2, Springer-Verlag, Berlin 1993.
20. Hanani, H. (Chaim Chojnacki), Über wesentlich unplättbare Kurven im dreidimensionalen Raume. Fund. Math. 23 (1934), 135-142.
21. Kasteleyn, P.W., The statistics of dimers on a lattice. I. The number of dimer arrangements on a quadratic lattice. Physica 27 (1961), 1209-1225.
22. Kasteleyn, P.W., Dimer statistics and phase transitions. J. Math. Phys. 4 (1963), 287-293.
23. Kasteleyn, P. W., Graph theory and crystal physics. In Graph Theory and Theoretical Physics (ed. by F. Harary), Academic Press, New York 1967, 43-110.
24. Klee, V., Ladner, R., and Manber, R., Sign-solvability revisited. Linear Algebra Appl. 59 (1984), 131-158.
25. Lieb, E. H., and Loss, M., Fluxes, Laplacians, and Kasteleyn's theorem. Duke Math. J. 71 (1993), 337-363.
26. Little, C. H. C., Kasteleyn's theorem and arbitrary graphs. Canad. J. Math. 25 (1973), 758-764.
27. Little, C. H. C., A characterization of convertible (0, 1)-matrices. J. Combin. Theory Ser. B 18 (1975), 187-208.
28. Lovász, L., On chromatic number of finite set-systems. Acta Math. Acad. Sci. Hungar. 19 (1968), 59-67.
29. Lovász, L., Ear-decompositions of matching covered graphs. Combinatorica 2 (1983), 395-407.
30. Lovász, L., Some algorithmic problems on lattices. In Theory of Algorithms (ed. by L. Lovász and E. Szemerédi), Colloq. Math. Soc. Janos Bolyai 44, János Bolyai Mathematical Society, Budapest 1985, 323-337.
31. Lovász, L., Matching structure and the matching lattice. J. Combin. Theory Ser. B 43 (1987), 187-222.
32. Lovász, L., and Plummer, M., Matching theory. North-Holland Math. Stud. 121, Ann. of Discrete Math. 29, North-Holland, Amsterdam 1986.
33. McCuaig, W., Even dicycles. J. Graph Theory 35 (2000), 46-68.
34. McCuaig, W., Brace generation. J. Graph Theory 38 (2001), 124-169.
35. McCuaig, W., Pólya's permanent problem. Electron. J. Combin. 11 (2004), 83pp.
36. McCuaig, W., Robertson, N., Seymour, P. D., and Thomas, R., Permanents, Pfaffian orientations, and even directed circuits (Extended abstract). In Proceedings of the 29th annual Symposium on the Theory of Computing (STOC), ACM Press, New York 1997, 402-405.
37. Muir, T., The theory of determinants. MacMillan and Co., London 1906.
38. Norine, S., Drawing Pfaffian graphs. Submitted.
39. Norine, S., Matching structure and Pfaffian orientations of graphs. Ph.D. dissertation, Georgia Institute of Technology, 2005.
40. Norine, S., Pfaffian graphs, T -joins and crossing numbers. Submitted.
41. Norine, S., Drawing 4-Pfaffian graphs on the torus. Submitted.
42. Norine, S., and Thomas, R., Minimal bricks. J. Combin. Theory Ser. B 96 (4) (2006), 505-513.
43. Norine, S., and Thomas, R., Generating bricks. Submitted.
44. Norine, S., and Thomas, R., Pfaffian labelings and signs of edge-colorings. Submitted.
45. Norine, S., and Thomas, R., On minimally non-Pfaffian graphs. Manuscript.
46. Penrose, R., Applications of negative-dimensional tensors. In Combinatorial Mathematics and its Applications (ed. by D. J. A.Welsh), Academic Press, London 1971, 221-244.
47. Pólya, G., Aufgabe 424. Arch. Math. Phys. Ser. 20 (1913), 271.
48. Robertson, N., and Seymour, P. D., Graph MinorsV. Excluding a planar graph. J. Combin. Theory Ser. B 41 (1986), 92-114.
49. Robertson, N., Seymour, P. D., and Thomas, R., Quickly excluding a planar graph. J. Combin. Theory Ser. B 62 (1994), 323-348.
50. Robertson, N., Seymour, P. D., and Thomas, R., Permanents, Pfaffian orientations, and even directed circuits. Math. Ann. 150 (1999), 929-975.
51. Samuelson, P. A., Foundations of economic analysis.Harvard University Press, Cambridge, MA, 1947.
52. Seymour, P. D., On the two-colouring of hypergraphs. Quart. J. Math. Oxford 25 (1974), 303-312.
53. Seymour, P. D., and Thomassen, C., Characterization of even directed graphs. J. Combin. Theory Ser. B 42 (1987), 36-45.
54. Tait, P. G., Note on a theorem in geometry of position, Trans. Roy. Soc. Edinburgh 29 (1880), 657-660.
55. Temperley, H. N. V., and Fisher, M. E., Dimer problem in statistical mechanics-an exact result. Phil. Mag. 6 (1961), 1061-1063.
56. Tesler, G., Matching in graphs on non-orientable surfaces. J. Combin. Theory Ser. B 78 (2000), 198-231.
57. Thomassen, C., Even cycles in directed graphs. European J. Combin. 6 (1985), 85-89.
58. Thomassen, C., Sign-nonsingular matrices and even cycles in directed graphs. Linear Algebra Appl. 75 (1986), 27-41.
59. Thomassen, C., The even cycle problem for directed graphs. J. Amer. Math. Soc. 5 (1992), 217-229.
60. Thomassen, C., The even cycle problem for planar digraphs. J. Algorithms 15 (1993), 61-75.
61. Tutte, W. T., The factorization of linear graphs. J. London Math. Soc. 22 (1947), 107-111.
62. Tutte, W. T., Toward a theory of crossing numbers, J. Combin. Theory Ser. B 8 (1971), 45-53.
63. Valiant, L. G., The complexity of computing the permanent. Theoret. Comput. Sci. 8 (1979), 189-201.
64. Vazirani, V.V., andYannakakis, M., Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs. Discrete Appl. Math. 25 (1989), 179-190.
65. West, D., Introduction to Graph Theory. Prentice-Hall, Upper Saddle River, NJ, 2001.