A tight Erdős-Pósa function for long cycles (Q2396891): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jctb.2017.01.004 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2306414598 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1603.07588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-width and circumference of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Pósa property for long circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles through prescribed vertices have the Erdős‐Pósa property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-treewidth graph decompositions and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Circuits Contained in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tighter Erdős-Pósa Function for Long Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles through prescribed vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Pósa Property for Long Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint cycles intersecting a set of vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof and generalizations of a theorem of Erdős and Pósa on graphs withoutk+1 independent circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the presence of disjoint subgraphs of a specified type / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCTB.2017.01.004 / rank
 
Normal rank

Latest revision as of 09:32, 18 December 2024

scientific article
Language Label Description Also known as
English
A tight Erdős-Pósa function for long cycles
scientific article

    Statements

    A tight Erdős-Pósa function for long cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 May 2017
    0 references
    Erdős-Pósa property
    0 references
    covering vs packing
    0 references
    long cycles
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references