Unavoidable induced subgraphs of infinite 2-connected graphs

DOI10.1016/J.DISC.2024.114346MaRDI QIDQ7028876zbMATH OpenFDO

Authors Sarah R. Allred, Guoli Ding, Bogdan Oporowski

Publication date 11 February 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2024.114346

zbMATH Keywords

2-connected graphsinfinite graphsRamsey theory

Mathematics Subject Classification ID

Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Infinite graphs (05C63) Ramsey theory (05D10)

Cites work

• scientific article; zbMATH DE number 3566878 (Why is no real title available?)
• On a problem of formal logic.
• Typical subgraphs of 3- and 4-connected graphs
• Über eine Schlußweise aus dem Endlichen ins Unendliche.
• Unavoidable doubly connected large graphs
• Unavoidable induced subgraphs in large graphs with no homogeneous sets
• Unavoidable Induced Subgraphs of Large 2-Connected Graphs
• Unavoidable parallel minors of 4-connected graphs

Cited in

(1)

• The excluded minors for embeddability into a compact surface

This page was built for publication: Unavoidable induced subgraphs of infinite 2-connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028876)