Unavoidable Induced Subgraphs of Large 2-Connected Graphs

DOI10.1137/21m1447593zbMath1516.05138arXiv2009.12503OpenAlexW3089134724MaRDI QIDQ6098457

Bogdan Oporowski, Sarah R. Allred, Guoli Ding

Publication date: 14 June 2023

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.12503

zbMATH Keywords

Ramsey theorem2-connected graphsunavoidable induced subgraphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Generalized Ramsey theory (05C55) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Typical subgraphs of 3- and 4-connected graphs
• A Ramsey-type theorem for traceable graphs
• Unavoidable minors of large 3-connected matroids
• Unavoidable minors of large 3-connected binary matroids
• Unavoidable parallel minors of 4-connected graphs

This page was built for publication: Unavoidable Induced Subgraphs of Large 2-Connected Graphs