Papers
Topics
Authors
Recent
Search
2000 character limit reached

Excluding a clique or a biclique in graphs of bounded induced matching treewidth

Published 7 May 2024 in math.CO | (2405.04617v2)

Abstract: For a tree decomposition $\mathcal{T}$ of a graph $G$, let $\mu(\mathcal{T})$ denote the maximum size of an induced matching in $G$ with the property that some bag of $\mathcal{T}$ contains at least one endpoint of every edge of the matching. The induced matching treewidth of a graph $G$ is the minimum value of $\mu(\mathcal{T})$ over all tree decompositions $\mathcal{T}$ of $G$. Classes of graphs with bounded induced matching treewidth admit polynomial-time algorithms for a number of problems, including INDEPENDENT SET, $k$-COLORING, ODD CYCLE TRANSVERSAL, and FEEDBACK VERTEX SET. In this paper, we focus on combinatorial properties of such classes. First, we show that graphs with bounded induced matching treewidth that exclude a fixed biclique as an induced subgraph have bounded tree-independence number, which is another well-studied parameter defined in terms of tree decompositions. This sufficient condition about excluding a biclique is also necessary, as bicliques have unbounded tree-independence number. Second, we show that graphs with bounded induced matching treewidth that exclude a fixed clique have bounded chromatic number, that is, classes of graphs with bounded induced matching treewidth are $\chi$-bounded. The two results confirm two conjectures due to Lima et al. [ESA 2024].

Definition Search Book Streamline Icon: https://streamlinehq.com
References (23)
  1. Tree independence number I. (Even hole, diamond, pyramid)-free graphs. arXiv:2305.16258, 2023.
  2. Complexity of finding embeddings in a k𝑘kitalic_k-tree. SIAM Journal on Algebraic Discrete Methods, 8(2):277–284, 1987.
  3. New width parameters for independent set: one-sided-mim-width and neighbor-depth. In Daniël Paulusma and Bernard Ries, editors, Graph-Theoretic Concepts in Computer Science, 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28–30, 2023, Revised Selected Papers, volume 14093 of Lecture Notes in Computer Science, pages 72–85. Springer, 2023.
  4. Nonserial Dynamic Programming. Academic Press, 1972.
  5. Comparing width parameters on graph classes. arXiv:2308.05817, 2023.
  6. Separating polynomial χ𝜒\chiitalic_χ-boundedness from χ𝜒\chiitalic_χ-boundedness. Combinatorica, 44:1–8, 2024.
  7. Tree independence number II. Three-path-configurations. arXiv:2405.00265, 2024.
  8. Parameterized Algorithms. Springer, 2015.
  9. New results on maximum induced matchings in bipartite graphs and beyond. Theoretical Computer Science, 478:33–40, 2013.
  10. Computing tree decompositions with small independence number. In Karl Bringmann, Martin Grohe, Gabriele Puppis, and Ola Svensson, editors, 51th International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8–12, 2024, Tallinn, Estonia, volume 297 of LIPIcs. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024. To appear.
  11. Treewidth versus clique number. II. Tree-independence number. Journal of Combinatorial Theory, Series B, 164:404–442, 2024.
  12. Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure. Journal of Combinatorial Theory, Series B, 167:338–391, 2024.
  13. A survey of degree-boundedness. arXiv:2403.05737, 2024.
  14. Induced subdivisions in Ks,ssubscript𝐾𝑠𝑠K_{s,s}italic_K start_POSTSUBSCRIPT italic_s , italic_s end_POSTSUBSCRIPT-free graphs with polynomial average degree. arXiv:2310.18452, 2024.
  15. András Gyárfás. On the chromatic number of multiple interval graphs and overlap graphs. Discrete Mathematics, 55(2):161–166, 1985.
  16. Rudolf Halin. S𝑆Sitalic_S-functions for graphs. Journal of Geometry, 8(1):171–186, 1976.
  17. A width parameter useful for chordal and co-comparability graphs. Theoretical Computer Science, 704:1–17, 2017.
  18. Tree decompositions meet induced matchings: beyond Max Weight Independent Set. arXiv:2402.15834, 2024.
  19. Graph minors. III. Planar tree-width. Journal of Combinatorial Theory, Series B, 36(1):49–64, 1984.
  20. Graph minors. XVII. Taming a vortex. Journal of Combinatorial Theory, Series B, 77(1):162–210, 1999.
  21. Graph minors. XVIII. Tree-decompositions and well-quasi-ordering. Journal of Combinatorial Theory, Series B, 89(1):77–108, 2003.
  22. A survey of χ𝜒\chiitalic_χ-boundedness. Journal of Graph Theory, 95(3):473–504, 2020.
  23. Nikola Yolov. Minor-matching hypertree width. In Artur Czumaj, editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pages 219–233. SIAM, 2018.
Citations (1)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.

Sign Up for Free