Skip to main content
SpringerLink
Log in

Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

Given a graph H, we prove that every (theta, prism)-free graph of sufficiently large treewidth contains either a large clique or an induced subgraph isomorphic to H, if and only if H is a forest.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Aboulker, P., Adler, I., Kim, E.J., Sintiari, N.L.D., Trotignon, N.: On the treewidth of even-hole-free graphs. Eur. J. Combinat. 98, 103394 (2021)

    Article  Google Scholar 

  2. Abrishami,T., Alecu,B., Chudnovsky,M., Hajebi,S., Spirkl,S.: Induced subgraphs and tree decompositions VII. Basic obstructions in \(H\)-free graphs. arXiv:2212.02737 (2022)

  3. Abrishami,T., Chudnovsky,M., Dibek,C., Hajebi,S., Rzążewski,P., Spirkl,S., Vušković,K.: Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree. arXiv:2108.01162 (2021)

  4. Abrishami, T., Chudnovsky, M., Vušković, K.: Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree. J. Combin. Theory Ser. B 157, 144–175 (2022)

    Article  MathSciNet  Google Scholar 

  5. Bodlaender, H.L.: Dynamic programming on graphs with bounded treewidth, pp. 105–118. Springer, Berlin, Heidelberg (1988)

  6. Cameron, K., da Silva, M.V., Huang, S., Vušković, K.: Structure and algorithms for (cap, even hole)-free graphs. Discrete Math. 341(2), 463–473 (2018)

    Article  MathSciNet  Google Scholar 

  7. Chudnovsky,M., Seymour,P.: Even-hole-free graphs still have bisimplicial vertices. arXiv:1909.10967 (2019)

  8. Chudnovsky, M., Seymour, P.: The three-in-a-tree problem. Combinatorica 30(4), 387–417 (2010)

    Article  MathSciNet  Google Scholar 

  9. Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Annal. Math 164, 51–229 (2006)

    Article  MathSciNet  Google Scholar 

  10. Davies, J.: Appeared in an Oberwolfach technical report https://doi.org/10.4171/OWR/2022/1

  11. Davies,J.: Vertex-minor-closed classes are \(\chi \)-bounded. arXiv:2008.05069 (2020)

  12. Erde, J., Weißauer, D.: A short derivation of the structure theorem for graphs with excluded topological minors. SIAM J. Discrete Math. 33(3), 1654–1661 (2019)

    Article  MathSciNet  Google Scholar 

  13. Grohe, M., Marx, D.: Structure theorem and isomorphism test for graphs with excluded topological subgraphs. SIAM J. Comput. 44(1), 114–159 (2015)

    Article  MathSciNet  Google Scholar 

  14. Kierstead, H.A., Penrice, S.G.: Radius two trees specify \(\chi \)-bounded classes. J. Graph Theo. 18(2), 119–129 (1994)

    Article  MathSciNet  Google Scholar 

  15. Korhonen, T.: Grid Induced Minor Theorem for Graphs of Small degree. J. Combin. Theory Ser. B 160, 206–214 (2023)

    Article  MathSciNet  Google Scholar 

  16. Lozin, V., Razgon, I.: Tree-width dichotomy. Eur. J. Combinat. 103, 103517 (2022)

    Article  MathSciNet  Google Scholar 

  17. Menger, K.: Zur allgemeinen Kurventheorie. Fund. Math. 10, 96–115 (1927)

    Article  Google Scholar 

  18. Ramsey, F.P.: On a problem of formal logic. Proc. London Math. Soc. 30, 264–286 (1930)

    Article  MathSciNet  Google Scholar 

  19. Robertson, N., Seymour, P.: Graph minors. V. Excluding a planar graph. J. Combin. Theory Ser. B 41(1), 92–114 (1996)

    Article  MathSciNet  Google Scholar 

  20. Sintiari, N.L.D., Trotignon, N.: (Theta, triangle)-free and (even-hole, \(K_4\))-free graphs. Part 1: Layered wheels. J. Graph Theory 97(4), 475–509 (2021)

    Article  MathSciNet  Google Scholar 

  21. Trotignon, N.: Private communication (2021)

Download references

Acknowledgements

We thank an anonymous referee for carefully reading the draft and suggesting several improvements. We acknowledge the support of the Natural Sciences and Engineering Research Council of Canada (NSERC), [funding reference number RGPIN-2020-03912]. Cette recherche a été financée par le Conseil de recherches en sciences naturelles et en génie du Canada (CRSNG), [numéro de référence RGPIN-2020-03912]. This project was funded in part by the Government of Ontario.

Author information

Authors and Affiliations

  1. Princeton University, Princeton, NJ, USA

    Tara Abrishami & Maria Chudnovsky

  2. School of Computing, University of Leeds, Leeds, UK

    Bogdan Alecu

  3. Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada

    Sepehr Hajebi & Sophie Spirkl

Authors
  1. Tara Abrishami
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bogdan Alecu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maria Chudnovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sepehr Hajebi
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Sophie Spirkl
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sepehr Hajebi.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Supported by NSF-EPSRC Grant DMS-2120644 and by AFOSR grant FA9550-22-1-0083. Supported by DMS-EPSRC Grant EP/V002813/1.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Abrishami, T., Alecu, B., Chudnovsky, M. et al. Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs. Combinatorica (2024). https://doi.org/10.1007/s00493-024-00097-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00493-024-00097-0

Search

Navigation