A complete description of convex sets associated with matchings and edge-connectivity in graphs

Michael A. Henning*, Anders Yeo

*Kontaktforfatter for dette arbejde

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Abstrakt

Let (Formula presented.) be the set of pairs (Formula presented.) of real numbers with the property there exists a constant (Formula presented.), depending only on (Formula presented.) and (Formula presented.), such that (Formula presented.) for every connected graph (Formula presented.) of order (Formula presented.), size (Formula presented.), with maximum degree at most (Formula presented.) and edge-connectivity at least (Formula presented.). In a recent paper, the authors give a complete description of the set (Formula presented.). In this article we raise the problem to a higher level, and give a complete description of the convex set (Formula presented.) for all (Formula presented.), and determine its extreme points.

OriginalsprogEngelsk
TidsskriftJournal of Graph Theory
ISSN0364-9024
DOI
StatusE-pub ahead of print - 2022

Bibliografisk note

Funding Information:
The authors wish to thank the referees for their considerable efforts in working through our article, and for their very helpful comments and suggestions that resulted in a much improved version of the article. Research of the first author supported in part by the University of Johannesburg, and research of the second author supported by the Danish research council under grant number DFF‐7014‐00037B.

Publisher Copyright:
© 2022 Wiley Periodicals LLC.

Fingeraftryk

Dyk ned i forskningsemnerne om 'A complete description of convex sets associated with matchings and edge-connectivity in graphs'. Sammen danner de et unikt fingeraftryk.

Citationsformater