Unavoidable cycle-contraction minors of large 2-connected graphs

DOI10.1137/25M1745052MaRDI QIDQ7253578zbMATH OpenFDO

Authors Wayne Ge, James Oxley

Publication date 27 May 2026

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

Full work available at URL https://doi.org/10.1137/25M1745052

zbMATH Keywords

graph minorsmatroidsRamsey theoretic results

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40) Generalized Ramsey theory (05C55) Structural characterization of families of graphs (05C75) Graph minors (05C83)

Cites work

• Decomposition of regular matroids
• Graph theory
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• On a problem of formal logic.
• Typical subgraphs of 3- and 4-connected graphs
• Unavoidable Induced Subgraphs of Large 2-Connected Graphs
• Unavoidable parallel minors of 4-connected graphs

This page was built for publication: Unavoidable cycle-contraction minors of large 2-connected graphs

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