Tight lower bounds on the matching number in a graph with given maximum degree (Q4553732)

From MaRDI portal
Revision as of 20:15, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article; zbMATH DE number 6969499
Language Label Description Also known as
English
Tight lower bounds on the matching number in a graph with given maximum degree
scientific article; zbMATH DE number 6969499

    Statements

    Tight lower bounds on the matching number in a graph with given maximum degree (English)
    0 references
    0 references
    0 references
    31 October 2018
    0 references
    convex set
    0 references
    matching number
    0 references
    maximum degree
    0 references

    Identifiers