On the Edge-Erdős–Pósa Property of Ladders

DOI10.1007/S00373-024-02765-WMaRDI QIDQ6489358zbMATH OpenFDO

Authors Raphael Steck, Arthur Ulmer

Publication date 21 April 2024

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)

Recommendations

• The edge-Erdős-Pósa property
• Erdös-Ko-Rado theorem for ladder graphs
• An edge variant of the Erdős-Pósa property
• The Erdös-Pósa property for long circuits
• Even A‐cycles have the edge‐Erdős–Pósa property

Cites work

• A tight Erdős-Pósa function for planar minors
• An approximate max-Steiner-tree-packing min-Steiner-cut theorem
• An edge variant of the Erdős-Pósa property
• Dense minors in graphs of large girth
• Edge-disjoint trees containing some given vertices in a graph
• Erdős-Pósa from ball packing
• Frames, \(A\)-paths, and the Erdős-Pósa property
• Graph minors. V. Excluding a planar graph
• Long cycles have the Edge-Erdős-Pósa property
• On Independent Circuits Contained in a Graph
• Packing Steiner trees
• Packing of Steiner trees and \(S\)-connectors in graphs
• Recent techniques and results on the Erdős-Pósa property
• The edge-Erdős-Pósa property
• \(K_4\)-subdivisions have the edge-Erdős-Pósa property
• Über die Maximalzahl kantendisjunkter A-Wege

This page was built for publication: On the Edge-Erdős–Pósa Property of Ladders

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