Pósa's conjecture for graphs of order at least 2 × 10<sup>8</sup> (Q5388972): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q200923 / rank
Normal rank
 
Property / author
 
Property / author: Henry A. Kierstead / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989326777 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q123284330 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1104.4367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square of paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian square-paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a graph into two square-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to avoid using the regularity Lemma: Pósa's conjecture revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact minimum degree condition for Hamilton cycles in oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the square of a Hamiltonian cycle in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Seymour conjecture for large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dirac-Type Theorem for 3-Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on some embedding problems for oriented graphs / rank
 
Normal rank

Latest revision as of 02:15, 5 July 2024

scientific article; zbMATH DE number 6027438
Language Label Description Also known as
English
Pósa's conjecture for graphs of order at least 2 × 10<sup>8</sup>
scientific article; zbMATH DE number 6027438

    Statements

    Identifiers

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