mycoreobjectrosdok_document_0000027968rosdok_document_0000027968rosdokdocumentrosdok_derivate_00002299072026-10-14T11:40:24.445Z2026-10-14T11:34:18.321ZMCRJANITOReditorKEpublished1rosdok_derivate_0000229907truetruederivate_types:fulltextVolltextfulltextwf_edit_epub wf_register_epubstate:publishedstate:publishedveröffentlichtpublishedrosdok_id000058311986748545Oau2026-10-142026-10-14T11:37:30ZrdaConverted from PICA to MODS using Pica2MODS XSLT Transformer 2.14-SNAPSHOT [SCM: "" "" ""] with mode 'DEFAULT'.WorkingpaperNote on a conjecture concerning spanning subgraphs with degree constraintsIn this brief note, we give a positive answer to a question that has recently been asked by L. Addario-Berry et al. in this journal, namely: Given a graph G = (V,E) and for every vertex v ∈ V a list Dv ⋸ {0,1,...,d(v)} satisfying |Dv| >= D(v)/2 + 1, does there necessarily exist a spanning subgraph H of G such that dH(v) ∈ Dv holds for every v ∈ V?ChristianReiher1984 -VerfasserInaut1013370627https://purl.uni-rostock.de/rosdok/id00005831urn:nbn:de:gbv:28-rosdok_id00005831-810.18453/rosdok_id00005831510 MathematikMathematisch-Naturwissenschaftliche Fakultätalle Rechte vorbehaltenRechteinhaber Universität Rostockfrei zugänglich (Open Access)Lizenz Metadaten: CC0en1 Online-Ressource (3 Seiten)2008University of Rostock, Institute of MathematicsRostockmonographic20082026Universitätsbibliothek RostockRostock2026Universitätsbibliothek Rostockhttps://purl.uni-rostock.de/rosdok/id00005831Christian Reiherrosdok_id000058161986139832Odvhttps://purl.uni-rostock.de/rosdok/id00005816Preprints aus dem Institut für Mathematik3255797-808/10008-0001doctype:epubdoctype:epubDokumenttypDocument typedoctype:epub.workingpaperdoctype:epub.workingpaperWorkingpaperworking paperdiniPublType:workingPaper diniPublType2022:WorkingPaperinfo:eu-repo/semantics/workingPaperdocumentdiniPublType2022:WorkingPaperdiniPublType2022:WorkingPaperArbeitspapierWorking paperKDSF (Pu37)SDNB:510SDNB:510510 Mathematik510 Mathematicsinstitution:unirostockinstitution:unirostockUniversität RostockUniversity of RostockUniversität RostockUniversität RostockUni.Rostockhttp://d-nb.info/gnd/38329-6institution:unirostock.mnfinstitution:unirostock.mnfMathematisch-Naturwissenschaftliche FakultätFaculty of Mathematics and Natural SciencesUniversität Rostock. Mathematisch-Naturwissenschaftliche FakultätMathematisch-Natur-<br />wissenschaftliche FakultätUni.Rostock.Fakultaet.MNFhttp://d-nb.info/gnd/2147083-2licenseinfo:worklicenseinfo:workWerkworklicenseinfo:work.rightsreservedlicenseinfo:work.rightsreservedalle Rechte vorbehaltenall rights reserved/creativecommons/r/reserved/0.9/88x31.png[DE-28]Urheberrechtsschutz 1.0$gRights Statements$uhttp://rightsstatements.org/vocab/InC/1.0/http://rightsstatements.org/vocab/InC/1.0/http://rightsstatements.org/vocab/InC/1.0/licenseinfo:depositlicenseinfo:depositVeröffentlichungsgenehmigungpermission to storelicenseinfo:deposit.rightsunirostocklicenseinfo:deposit.rightsunirostockRechteinhaber Universität Rostockrightsholder Rostock Universityaccesscondition:openaccessaccesscondition:openaccessfrei zugänglich (Open Access)open accesshttp://purl.org/coar/access_right/c_abf2OAfreeinfo:eu-repo/semantics/openAccess[DE-28]Open Access$gControlled Vocabulary for Access Rights$uhttp://purl.org/coar/access_right/c_abf2licenseinfo:metadatalicenseinfo:metadataLizenzen für Metadatenlicenseinfo:metadata.cc0licenseinfo:metadata.cc0Lizenz Metadaten: CC0license metadata: CC0/creativecommons/p/zero/1.0/88x31.pnghttps://creativecommons.org/publicdomain/zero/1.0/rfc5646:enrfc5646:enEnglischEnglishengengNote on a conjecture concerning spanning subgraphs with degree constraintsNote on a conjecture concerning spanning subgraphs with degree constraintsgnd:1013370627gnd:1013370627rosdok_document_0000027968-d3752576e49gnd:1013370627Christian ReiherChristian ReiherChristian ReiherChristian ReiherChristian ReiherRostockUniversity of Rostock, Institute of Mathematicsepub.workingpaperhttps://purl.uni-rostock.de/rosdok/id00005831urn:nbn:de:gbv:28-rosdok_id00005831-810.18453/rosdok_id00005831In this brief note, we give a positive answer to a question that has recently been asked by L. Addario-Berry et al. in this journal, namely: Given a graph G = (V,E) and for every vertex v ∈ V a list Dv ⋸ {0,1,...,d(v)} satisfying |Dv| >= D(v)/2 + 1, does there necessarily exist a spanning subgraph H of G such that dH(v) ∈ Dv holds for every v ∈ V?20082008Preprints aus dem Institut für Mathematikrosdok_id000058161986139832Odvhttps://purl.uni-rostock.de/rosdok/id00005816Preprints aus dem Institut für Mathematik3255797-808/10008-0001https://purl.uni-rostock.de/rosdok/id000058163255797-8Christian Reiherepub.workingpaper1 Reiher_note_2008.pdf 117290 ae6aac3b4f1f8e442c41a182b718316d rosdok_id000058311986748545Oau2026-10-142026-10-14T11:37:30ZrdaConverted from PICA to MODS using Pica2MODS XSLT Transformer 2.14-SNAPSHOT [SCM: "" "" ""] with mode 'DEFAULT'.WorkingpaperNote on a conjecture concerning spanning subgraphs with degree constraintsIn this brief note, we give a positive answer to a question that has recently been asked by L. Addario-Berry et al. in this journal, namely: Given a graph G = (V,E) and for every vertex v ∈ V a list Dv ⋸ {0,1,...,d(v)} satisfying |Dv| >= D(v)/2 + 1, does there necessarily exist a spanning subgraph H of G such that dH(v) ∈ Dv holds for every v ∈ V?ChristianReiher1984 -VerfasserInaut1013370627https://purl.uni-rostock.de/rosdok/id00005831urn:nbn:de:gbv:28-rosdok_id00005831-810.18453/rosdok_id00005831510 MathematikMathematisch-Naturwissenschaftliche Fakultätalle Rechte vorbehaltenRechteinhaber Universität Rostockfrei zugänglich (Open Access)Lizenz Metadaten: CC0en1 Online-Ressource (3 Seiten)2008University of Rostock, Institute of MathematicsRostockmonographic20082026Universitätsbibliothek RostockRostock2026Universitätsbibliothek Rostockhttps://purl.uni-rostock.de/rosdok/id00005831Christian Reiherrosdok_id000058161986139832Odvhttps://purl.uni-rostock.de/rosdok/id00005816Preprints aus dem Institut für Mathematik3255797-808/10008-0001 2026-10-14T11:34:18.321Z 2026-10-14T11:40:24.445Z 2026-10-24T11:40:24.454Z editorKE {"identifier":"rosdok/id00005831","type":"local_id","additional":"","service":"MCRLocalID","created":"2026-10-14T11:34:18.331Z"} {"identifier":"urn:nbn:de:gbv:28-rosdok_id00005831-8","type":"dnbUrn","additional":"","service":"RosDokURN","created":"2026-10-14T11:34:18.341Z"} {"identifier":"https://purl.uni-rostock.de/rosdok/id00005831","type":"purl","additional":"","service":"RosDokPURL","created":"2026-10-14T11:34:18.346Z","registrationStarted":"2026-10-14T11:40:23.221Z"} {"identifier":"10.18453/rosdok_id00005831","type":"doi","additional":"","service":"RosDokDOI","created":"2026-10-14T11:34:18.351Z","registrationStarted":"2026-10-14T11:40:23.003Z","registered":"2026-10-14T11:40:24.441Z"} MCRJANITORfulltextfile/rosdok_document_0000027968/rosdok_derivate_0000229907/Reiher_note_2008.pdfNote on a conjecture concerning spanning subgraphs with degree constraintsNote on a conjecture concerning spanning subgraphs with degree constraintsgnd:1013370627gnd:1013370627rosdok_document_0000027968-d3752576e49gnd:1013370627Christian ReiherChristian ReiherChristian ReiherChristian ReiherChristian ReiherRostockUniversity of Rostock, Institute of Mathematicsepub.workingpaperhttps://purl.uni-rostock.de/rosdok/id00005831urn:nbn:de:gbv:28-rosdok_id00005831-810.18453/rosdok_id00005831In this brief note, we give a positive answer to a question that has recently been asked by L. Addario-Berry et al. in this journal, namely: Given a graph G = (V,E) and for every vertex v ∈ V a list Dv ⋸ {0,1,...,d(v)} satisfying |Dv| >= D(v)/2 + 1, does there necessarily exist a spanning subgraph H of G such that dH(v) ∈ Dv holds for every v ∈ V?20082008Preprints aus dem Institut für Mathematikrosdok_id000058161986139832Odvhttps://purl.uni-rostock.de/rosdok/id00005816Preprints aus dem Institut für Mathematik3255797-808/10008-0001https://purl.uni-rostock.de/rosdok/id000058163255797-8Christian Reiher[xslt]Saxonrosdok_id00005831https://purl.uni-rostock.de/rosdok/id00005831198674854510.18453/rosdok_id00005831urn:nbn:de:gbv:28-rosdok_id00005831-8Christian ReiherReiher ChristianNote on a conjecture concerning spanning subgraphs with degree constraintsWorkingpaperworking paperUniversity of Rostock, Institute of Mathematics, 2008In this brief note, we give a positive answer to a question that has recently been asked by L. Addario-Berry et al. in this journal, namely: Given a graph G = (V,E) and for every vertex v ∈ V a list Dv ⋸ {0,1,...,d(v)} satisfying |Dv| >= D(v)/2 + 1, does there necessarily exist a spanning subgraph H…rosdok_id000058160008-000108/1Christian ReiherNote on a conjecture concerning spanning subgraphs with degree constraintsPreprints aus dem Institut für MathematikUniversitätsbibliothek Rostockhttps://purl.uni-rostock.de/rosdok/id00005831ChristianReiher1984 -VerfasserInaut1013370627[purl]https://purl.uni-rostock.de/rosdok/id00005831[urn]urn:nbn:de:gbv:28-rosdok_id00005831-8[doi]10.18453/rosdok_id00005831open_access20082008epoch:21th_centuryrfc5646:endoctype:epub.workingpaperaccesscondition:openaccessSDNB:510institution:unirostock.mnfstate:published