A variation of a theorem by Pósa (Q2421858): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A method in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5722820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stability version for a theorem of Erdős on nonhamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5578810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of cliques in graphs without long cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342985 / rank
 
Normal rank

Latest revision as of 13:16, 19 July 2024

scientific article
Language Label Description Also known as
English
A variation of a theorem by Pósa
scientific article

    Statements

    A variation of a theorem by Pósa (English)
    0 references
    0 references
    0 references
    0 references
    18 June 2019
    0 references
    Turán problem
    0 references
    Hamiltonian cycles
    0 references
    extremal graph theory
    0 references

    Identifiers