A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits

DOI10.1007/BF02020974MaRDI QIDQ5538409zbMATH OpenOpenAlexFDO

Authors Miklós Simonovits

Publication date 1967

Published in Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02020974

zbMATH Keywords

topology

Cites work

• Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
• On Independent Circuits Contained in a Graph

Cited in

(17)

• Packing edge-disjoint cycles in graphs and the cyclomatic number
• Packing disjoint cycles over vertex cuts
• On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs
• Frames, \(A\)-paths, and the Erdős-Pósa property
• Erdős-Pósa property of chordless cycles and its applications
• Erdös-Pósa Property of Obstructions to Interval Graphs
• Disjoint cycles intersecting a set of vertices
• Short disjoint cycles in graphs with degree constraints
• Graph theory
• Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
• Half-integral packing of odd cycles through prescribed vertices
• Packing cycles through prescribed vertices
• Erdős–Pósa property of obstructions to interval graphs
• Packing and covering induced subdivisions
• A tight Erdős-Pósa function for long cycles
• Recent techniques and results on the Erdős-Pósa property
• Edge-disjoint odd cycles in planar graphs.

This page was built for publication: A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits

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