Minimum degree conditions for containing an r-regular r-connected spanning subgraph

Kurzanzeige
dc.contributor.authorHahn-Klimroth, Max
dc.contributor.authorParczyk, Olaf
dc.contributor.authorPerson, Yury
dc.date.accessioned2026-09-30T11:53:50Z
dc.date.issued2024-02-26
dc.description.abstractWe study optimal minimum degree conditions when an n-vertex graph G contains an r-regular r-connected spanning subgraph. We prove for r fixed and n large the condition to be δ(G)≥(n+r−2)/2 when nr≡0 (mod 2). This answers a question of M. Kriesell.en
dc.identifier.urihttp://hdl.handle.net/2003/45084
dc.language.isoen
dc.relation.ispartofseriesEuropean journal of combinatorics; 118
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subject.ddc004
dc.titleMinimum degree conditions for containing an r-regular r-connected spanning subgraphen
dc.typeText
dc.type.publicationtypeResearchArticle
dcterms.accessRightsopen access
eldorado.dnb.deposittrue
eldorado.doi.registerfalse
eldorado.secondarypublicationtrue
eldorado.secondarypublication.primarycitationMax Hahn-Klimroth, Olaf Parczyk, Yury Person, Minimum degree conditions for containing an r-regular r-connected spanning subgraph, European Journal of Combinatorics, Volume 118, 2024, 103940, https://doi.org/10.1016/j.ejc.2024.103940
eldorado.secondarypublication.primaryidentifierhttps://doi.org/10.1016/j.ejc.2024.103940

Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild
Name:
1-s2.0-S0195669824000258-main.pdf
Größe:
715.42 KB
Format:
Adobe Portable Document Format
Beschreibung:
DNB
Herunterladen

Lizenzbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild
Name:
license.txt
Größe:
4.82 KB
Format:
Item-specific license agreed upon to submission
Beschreibung:
Herunterladen

Sammlungen

LS 02 Komplexitätstheorie und Effiziente Algorithmen