Just Accepted
Killing a Vortex
Abstract
The Graph Minors Structure Theorem of Robertson and Seymour asserts that, for every graph H, every H-minor-free graph can be obtained by clique-sums of “almost embeddable” graphs. Here a graph is “almost embeddable” if it can be obtained from a graph of bounded Euler-genus by pasting graphs of bounded pathwidth in an “orderly fashion” into a bounded number of faces, called the vortices, and then adding a bounded number of additional vertices, called apices, with arbitrary neighborhoods. Our main result is a full classification of all graphs H for which the use of vortices in the theorem above can be avoided. To this end we identify a (parametric) graph \( \mathscr{S}_t \) and prove that all \( \mathscr{S}_t \)-minor-free graphs can be obtained by clique-sums of graphs embeddable in a surface of bounded Euler-genus after deleting a bounded number of vertices. We show that this result is tight in the sense that the appearance of vortices cannot be avoided for H-minor-free graphs, whenever H is not a minor of \( \mathscr{S}_t \) for some \(t\in \mathbb {N}. \) Using our new structure theorem, we design an algorithm that, given an \( \mathscr{S}_t \)-minor-free graph G, computes the generating function of all perfect matchings of G in polynomial time. Our results, combined with known complexity results, imply a complete characterization of minor-closed graph classes where the number of perfect matchings is polynomially computable: They are exactly those graph classes that do not contain every \( \mathscr{S}_t \) as a minor. This provides a sharp complexity dichotomy for the problem of counting perfect matchings in minor-closed classes.
References
[1]
Manindra Agrawal. 2006. Determinant Versus Permanent. In In Proceedings of the 25th International Congress of Mathematicians, ICM 2006, Vol. 3. 985–997.
[2]
Julien Baste, Ignasi Sau, and Dimitrios M. Thilikos. 2023. Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm. SIAM J. Comput. 52, 4 (2023), 865–912. https://doi.org/10.1137/21m140482x
[3]
Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, and Gerhard J. Woeginger. 2007. A polynomial time equivalence between DNA sequencing and the exact perfect matching problem. Discret. Optim. 4, 2 (2007), 154–162. https://doi.org/10.1016/j.disopt.2006.07.004
[4]
Jin-yi Cai, Pinyan Lu, and Mingji Xia. 2009. Holant problems and counting CSP. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, Michael Mitzenmacher (Ed.). ACM, 715–724. https://doi.org/10.1145/1536414.1536511
[5]
Jin-Yi Cai, Pinyan Lu, and Mingji Xia. 2016. Holographic Algorithms. In Encyclopedia of Algorithms. Springer, Berlin, 921–926. https://doi.org/10.1007/978-1-4939-2864-4_746
[6]
Arthur Cayley. 1847. Sur les Déterminants Gauches. In Journal für die reine und angewandte Mathematik Band 38. De Gruyter, 93–96.
[7]
Radu Curticapean. 2014. Counting perfect matchings in graphs that exclude a single-crossing minor. CoRR abs/1406.4056(2014). arXiv:1406.4056 http://arxiv.org/abs/1406.4056
[8]
Radu Curticapean. 2019. Counting problems in parameterized complexity. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018)(Leibniz International Proceedings in Informatics (LIPIcs), Vol. 115). Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 1:1–1:18. https://doi.org/10.4230/LIPIcs.IPEC.2018.1
[9]
Radu Curticapean and Mingji Xia. 2015. Parameterizing the permanent: genus, apices, minors, evaluation mod 2k. In IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, Venkatesan Guruswami (Ed.). IEEE Computer Society, 994–1009. https://doi.org/10.1109/FOCS.2015.65
[10]
Radu Curticapean and Mingji Xia. 2021. Parameterizing the permanent: hardness for K8-minor-free graphs. CoRR abs/2108.12879(2021). arXiv:2108.12879 https://arxiv.org/abs/2108.12879
[11]
Radu Curticapean and Mingji Xia. 2022. Parameterizing the Permanent: Hardness for Fixed Excluded Minors. In Symposium on Simplicity in Algorithms (SOSA). SIAM, 297–307.
[12]
Reinhard Diestel. 2017. Graph Theory. Vol. 173. Springer-Verlag, 5th edition. https://doi.org/10.1007/978-3-662-53622-3
[13]
Reinhard Diestel, Ken-ichi Kawarabayashi, Theodor Müller, and Paul Wollan. 2012. On the Excluded Minor Structure Theorem for Graphs of Large Tree-Width. J. Comb. Theory, Ser. B 102, 6 (2012), 1189–1210.
[14]
Walther Dyck. 1888. Beiträge zur Analysis situs I. Math. Ann. 32, 4 (1888), 457–512. https://doi.org/10.1007/BF01443580
[15]
Jack Edmonds. 1965. Paths, Trees, and Flowers. Canad. J. of Mathematics 17 (1965), 449–467.
[16]
David Eppstein and Vijay V. Vazirani. 2019. NC algorithms for computing a perfect matching, the number of perfect matchings, and a maximum flow in one-crossing-minor-free graphs. In The 31st ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019, Christian Scheideler and Petra Berenbrink (Eds.). ACM, 23–30. https://doi.org/10.1145/3323165.3323206
[17]
Anna Galluccio and Martin Loebl. 1999. On the Theory of Pfaffian Orientations. I. Perfect Matchings and Permanents. Electron. J. Comb. 6(1999). http://www.combinatorics.org/Volume_6/Abstracts/v6i1r6.html
[18]
Anna Galluccio, Martin Loebl, and Jan Vondrák. 2001. Optimization via Enumeration: A New Algorithm for the Max Cut Problem. Math. Programming 90, 2 (2001), 273–290.
[19]
Archontia C Giannopoulou, Stephan Kreutzer, and Sebastian Wiederrecht. 2021. Excluding a Planar Matching Minor in Bipartite Graphs. arXiv preprint arXiv:2106.00703(2021).
[20]
Petr A. Golovach, Giannos Stamoulis, and Dimitrios M. Thilikos. 2020. Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, Shuchi Chawla (Ed.). SIAM, 931–950. https://doi.org/10.1137/1.9781611975994.56
[21]
Rohit Gurjar, Arpita Korwar, Jochen Messner, and Thomas Thierauf. 2017. Exact Perfect Matching in Complete Graphs. ACM Trans. Comput. Theory 9, 2 (2017), 8:1–8:20. https://doi.org/10.1145/3041402
[22]
Frank Harary. 1991. Graph theory. Addison-Wesley.
[23]
Ken ichi Kawarabayashi, Robin Thomas, and Paul Wollan. 2021. Quickly excluding a non-planar graph. arxiv:2010.12397 [math.CO]
[24]
Heinz A Jung. 1970. Eine Verallgemeinerung des n-fachen Zusammenhangs für Graphen. Math. Ann. 187, 2 (1970), 95–103.
[25]
P.M. Kasteleyn. 1961. The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice. Physica 27(1961), 1209–1225.
[26]
P.M. Kasteleyn. 1967. Graph Theory and Crystal Physics. In In Graph Theory and Theoretical Physics. Academic Press, 43–110.
[27]
P. W. Kasteleyn. 1963. Dimer Statistics and Phase Transitions. J. Math. Phys. 4, 2 (1963), 287–293. https://doi.org/10.1063/1.1703953 arXiv:https://doi.org/10.1063/1.1703953
[28]
Ken-ichi Kawarabayashi, Robin Thomas, and Paul Wollan. 2018. A new proof of the flat wall theorem. J. Comb. Theory, Ser. B 129 (2018), 204–238. https://doi.org/10.1016/j.jctb.2017.09.006
[29]
Ken-ichi Kawarabayashi and Paul Wollan. 2010. A shorter proof of the graph minor algorithm: the unique linkage theorem. In Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, Leonard J. Schulman (Ed.). ACM, 687–694. https://doi.org/10.1145/1806689.1806784
[30]
Charles Little. 2006. An Extension of kasteleyn’s method of enumerating the 1-factors of planar graphs. Vol. 403. Springer, Berlin, 63–72. https://doi.org/10.1007/BFb0057377
[31]
Tonglai Liu, Jigang Wu, Jiaxing Li, Jingyi Li, and Zikai Zhang. 2021. Efficient algorithms for storage load balancing of outsourced data in blockchain network. Comput. J. (2021).
[32]
C. R. F. Maunder. 1996. Algebraic topology. Dover Publications, Inc., Mineola, NY. viii+375 pages. Reprint of the 1980 edition.
[33]
William McCuaig. 2004. Pólya’s Permanent Problem. Electron. J. Comb. 11, 1 (2004). http://www.combinatorics.org/Volume_11/Abstracts/v11i1r79.html
[34]
William McCuaig, Neil Robertson, Paul D. Seymour, and Robin Thomas. 1997. Permanents, pfaffian orientations, and even directed circuits (Extended Abstract). In Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, Texas, USA, May 4-6, 1997, Frank Thomson Leighton and Peter W. Shor (Eds.). ACM, 402–405. https://doi.org/10.1145/258533.258625
[35]
Christos H. Papadimitriou and Mihalis Yannakakis. 1982. The complexity of restricted spanning tree problems. J. ACM 29, 2 (1982), 285–309. https://doi.org/10.1145/322307.322309
[36]
Christophe Paul, Evangelos Protopapas, and Dimitrios M. Thilikos. 2023. Universal Obstructions of Graph Parameters. arxiv:2304.14121 [cs.DM]
[37]
György Pólya. 1913. Aufgabe 424. Arch. Math. Phys. (1913).
[38]
Neil Robertson and Paul Seymour. 2009. Graph Minors. XXI. Graphs with Unique Linkages. J. Comb. Theory, Ser. B 99, 3 (2009), 583–616.
[39]
Neil Robertson and Paul D Seymour. 1990. Graph Minors: IX. Disjoint Crossed Paths. J. Comb. Theory, Ser. B 49, 1 (1990), 40–77.
[40]
Neil Robertson and Paul D. Seymour. 1991. Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory, Ser. B 52, 2 (1991), 153–190. https://doi.org/10.1016/0095-8956(91)90061-N
[41]
Neil Robertson and Paul D Seymour. 1991. Graph Minors: X. Obstructions to Tree-Decomposition. J. Comb. Theory, Ser. B 52, 2 (1991), 153–190.
[42]
Neil Robertson and Paul D. Seymour. 1993. Excluding a graph with one crossing. In Graph structure theory (Seattle, WA, 1991). Amer. Math. Soc., Providence, RI, 669–675.
[43]
Neil Robertson and Paul D Seymour. 1995. Graph Minors: XIII. The Disjoint Paths Problem. J. Comb. Theory, Ser. B 63, 1 (1995), 65–110.
[44]
Neil Robertson and Paul D. Seymour. 2003. Graph Minors. XVI. Excluding a non-planar graph. J. Comb. Theory, Ser. B 89, 1 (2003), 43–76. https://doi.org/10.1016/S0095-8956(03)00042-X
[45]
Neil Robertson and Paul D. Seymour. 2004. Graph Minors. XX. Wagner’s conjecture. J. Comb. Theory, Ser. B 92, 2 (2004), 325–357. https://doi.org/10.1016/j.jctb.2004.08.001
[46]
Neil Robertson, P. D. Seymour, and Robin Thomas. 1999. Permanents, pfaffian orientations, and even directed circuits. Annals of Mathematics 150, 3 (1999), 929–975. http://www.jstor.org/stable/121059
[47]
Paul D Seymour. 1980. Disjoint Paths in Graphs. Discr. Mathematics 29, 3 (1980), 293–309.
[48]
Paul D Seymour and Robin Thomas. 1993. Graph Searching and a Min-Max Theorem for Tree-Width. J. Comb. Theory, Ser. B 58, 1 (1993), 22–33.
[49]
Yossi Shiloach. 1980. A Polynomial Solution to the Undirected Two Paths Problem. J. of the ACM (JACM) 27, 3 (1980), 445–456.
[50]
Simon Straub, Thomas Thierauf, and Fabian Wagner. 2014. Counting the number of perfect matchings in K5-free graphs. In IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014. IEEE Computer Society, 66–77. https://doi.org/10.1109/CCC.2014.15
[51]
H. N. V. Temperley and Michael E. Fisher. 1961. Dimer problem in statistical mechanics-an exact result. The Philosophical Magazine: A Journal of Theoretical Experimental and Applied Physics 6, 68 (1961), 1061–1063. https://doi.org/10.1080/14786436108243366 arXiv:https://doi.org/10.1080/14786436108243366
[52]
Glenn Tesler. 2000. Matchings in graphs on non-orientable surfaces. J. Comb. Theory, Ser. B 78, 2 (2000), 198–231. https://doi.org/10.1006/jctb.1999.1941
[53]
Dimitrios M. Thilikos and Sebastian Wiederrecht. 2023. Approximating branchwidth on parametric extensions of planarity. arxiv:2304.04517 [math.CO]
[54]
Dimitrios M. Thilikos and Sebastian Wiederrecht. 2023. Excluding Surfaces as Minors in Graphs. arxiv:2306.01724 [math.CO]
[55]
Carsten Thomassen. 1980. 2-Linked Graphs. Europ. J. of Combinatorics. 1, 4 (1980), 371–378.
[56]
Leslie G. Valiant. 1979. The Complexity of Computing the Permanent. Theor. Comput. Sci. 8(1979), 189–201. https://doi.org/10.1016/0304-3975(79)90044-6
[57]
Leslie G Valiant. 2008. Holographic Algorithms. SIAM J. Comput. 37, 5 (2008), 1565–1594.
[58]
Vijay V. Vazirani. 1989. NC Algorithms for computing the number of perfect matchings in K3, 3-free graphs and related problems. Inf. Comput. 80, 2 (1989), 152–164. https://doi.org/10.1016/0890-5401(89)90017-5
[59]
Guohun Zhu, Xiangyu Luo, and Yuqing Miao. 2008. Exact weight perfect matching of bipartite graph is NP-complete. In Proceedings of the World Congress on Engineering, Vol. 2. 1–7.
Recommendations
A generalization of Little's Theorem on Pfaffian orientations
Little (1975) [12] showed that, in a certain sense, the only minimal non-Pfaffian bipartite matching covered graph is the brace K"3","3. Using a stronger notion of minimality than the one used by Little, we show that every minimal non-Pfaffian brick G ...
Note: Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density
It is proved that for all positive integers d,k,s,t with t>=k+1 there is a positive integer M=M(d,k,s,t) such that every graph with edge density at least d+k and at least M vertices contains a k-connected subgraph on at least t vertices, or s pairwise ...
Det-extremal cubic bipartite graphs
Let G be a connected k–regular bipartite graph with bipartition V(G) = X ∪ Y and adjacency matrix A. We say G is det-extremal if per (A) = |det(A)|. Det–extremal k–regular bipartite graphs exist only for k = 2 or 3. McCuaig has characterized the det-...
Comments
Information & Contributors
Information
Published In
Copyright © 2024 Copyright held by the owner/author(s). Publication rights licensed to ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Online AM: 14 May 2024
Accepted: 02 May 2024
Revised: 04 February 2024
Received: 26 July 2022
Check for updates
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 46Total Downloads
- Downloads (Last 12 months)46
- Downloads (Last 6 weeks)18
Reflects downloads up to 27 Jul 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in