On the public citation graph
A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits
0 signed · 30 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02066678openalex-snapshot
Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
inferredcites →https://doi.org/10.4153/cjm-1965-035-8openalex-snapshot
On Independent Circuits Contained in a Graph
inferredcites →https://doi.org/10.5486/pmd.1962.9.1-2.02openalex-snapshot
On the maximal number of disjoint circuits of a graph
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22156openalex-snapshot
Long cycles through prescribed vertices have the Erdős‐Pósa property
inferred← citeshttps://doi.org/10.1002/jgt.22895openalex-snapshot
Erdős–Pósa property of obstructions to interval graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190120311openalex-snapshot
On feedback vertex sets and nonseparating independent sets in cubic graphs
inferred← citeshttps://doi.org/10.1002/mana.19690400104openalex-snapshot
Eigenschaften von Graphen, die keine k+1 knotenfremde Kreise enthalten
inferred← citeshttps://doi.org/10.1007/978-1-4614-7254-4_19openalex-snapshot
Paul Erdős’ Influence on Extremal Graph Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-60406-5_15openalex-snapshot
Paul Erdős’ Influence on Extremal Graph Theory
inferred← citeshttps://doi.org/10.1007/s00493-013-2865-6openalex-snapshot
Half-integral packing of odd cycles through prescribed vertices
inferred← citeshttps://doi.org/10.1007/s00493-017-3669-xopenalex-snapshot
Long Cycles have the Edge-Erdős-Pósa Property
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00133-xopenalex-snapshot
Short disjoint cycles in graphs with degree constraints
inferred← citeshttps://doi.org/10.1016/j.dam.2016.12.025openalex-snapshot
Recent techniques and results on the Erdős–Pósa property
inferred← citeshttps://doi.org/10.1016/j.disc.2009.07.017openalex-snapshot
Packing edge-disjoint cycles in graphs and the cyclomatic number
inferred← citeshttps://doi.org/10.1016/j.disc.2010.03.009openalex-snapshot
Packing disjoint cycles over vertex cuts
inferred← citeshttps://doi.org/10.1016/j.jctb.2011.03.004openalex-snapshot
Packing cycles through prescribed vertices
inferred← citeshttps://doi.org/10.1016/j.jctb.2012.05.004openalex-snapshot
Disjoint cycles intersecting a set of vertices
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.01.004openalex-snapshot
A tight Erdős–Pósa function for long cycles
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.05.002openalex-snapshot
Erdős-Pósa property of chordless cycles and its applications
inferred← citeshttps://doi.org/10.1016/s0095-8956(03)00078-9openalex-snapshot
Edge-disjoint odd cycles in planar graphs
inferred← citeshttps://doi.org/10.1137/1.9781611975031.109openalex-snapshot
Erd\H{o}s-P\'osa property of chordless cycles and its applications
inferred← citeshttps://doi.org/10.1137/17m1148542openalex-snapshot
Frames, $A$-Paths, and the Erdös--Pósa Property
inferred← citeshttps://doi.org/10.1137/18m1226166openalex-snapshot
Packing and Covering Induced Subdivisions
inferred← citeshttps://doi.org/10.1137/21m1435239openalex-snapshot
On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs
inferred← citeshttps://doi.org/10.1137/s0097539796305109openalex-snapshot
Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
inferred← citeshttps://doi.org/10.48550/arxiv.1412.8460openalex-snapshot
Graph colouring and the total Betti number
inferred← citeshttps://doi.org/10.5555/2095116.2095253openalex-snapshot
Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
inferred← citeshttps://doi.org/10.5614/ejgta.2014.2.1.2openalex-snapshot
On maximum cycle packings in polyhedral graphs
inferred← citeshttps://doi.org/10.70675/658f0687ze25fz44e7z9761z187dd29af957openalex-snapshot
Structural and algorithmic aspects of partial orderings of graphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.