DC FieldValueLanguage
dc.contributor.authorClemens, Dennis-
dc.contributor.authorPerson, Yury-
dc.date.accessioned2021-11-08T09:51:46Z-
dc.date.available2021-11-08T09:51:46Z-
dc.date.issued2015-11-12-
dc.identifier.citationElectronic Notes in Discrete Mathematics 49: 23-30 (2015-11)de_DE
dc.identifier.issn1571-0653de_DE
dc.identifier.urihttp://hdl.handle.net/11420/10808-
dc.description.abstractA uniform hypergraph H is called k-Ramsey for a hypergraph F, if no matter how one colors the edges of H with k colors, there is always a monochromatic copy of F. We say that H is minimal k-Ramsey for F, if H is k-Ramsey for F but every proper subhypergraph of H is not. Burr, Erdos and Lovasz [S. A. Burr, P. Erdos, and L. Lovász, On graphs of Ramsey type, Ars Combinatoria 1 (1976), no. 1, 167-190] studied various parameters of minimal Ramsey graphs. In this paper we initiate the study of minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs. We show that the smallest minimum vertex degree over all minimal k-Ramsey 3-uniform hypergraphs for Kt(3) is exponential in some polynomial in k and t. We also study the smallest possible minimum codegrees over minimal 2-Ramsey 3-uniform hypergraphs.en
dc.description.sponsorshipDeutsche Forschungsgemeinschaft (DFG)de_DE
dc.language.isoende_DE
dc.publisherElsevier Sciencede_DE
dc.relation.ispartofElectronic notes in discrete mathematicsde_DE
dc.subjectMinimal Ramsey hypergraphde_DE
dc.subjectMinimum degree and codegreede_DE
dc.subject.ddc510: Mathematikde_DE
dc.titleMinimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphsde_DE
dc.typeArticlede_DE
dc.type.diniarticle-
dcterms.DCMITypeText-
tuhh.abstract.englishA uniform hypergraph H is called k-Ramsey for a hypergraph F, if no matter how one colors the edges of H with k colors, there is always a monochromatic copy of F. We say that H is minimal k-Ramsey for F, if H is k-Ramsey for F but every proper subhypergraph of H is not. Burr, Erdos and Lovasz [S. A. Burr, P. Erdos, and L. Lovász, On graphs of Ramsey type, Ars Combinatoria 1 (1976), no. 1, 167-190] studied various parameters of minimal Ramsey graphs. In this paper we initiate the study of minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs. We show that the smallest minimum vertex degree over all minimal k-Ramsey 3-uniform hypergraphs for Kt(3) is exponential in some polynomial in k and t. We also study the smallest possible minimum codegrees over minimal 2-Ramsey 3-uniform hypergraphs.de_DE
tuhh.publisher.doi10.1016/j.endm.2015.06.005-
tuhh.publication.instituteMathematik E-10de_DE
tuhh.type.opus(wissenschaftlicher) Artikel-
dc.type.driverarticle-
dc.type.casraiJournal Article-
tuhh.container.volume49de_DE
tuhh.container.startpage23de_DE
tuhh.container.endpage30de_DE
dc.identifier.scopus2-s2.0-84947753444de_DE
local.status.inpressfalsede_DE
local.funding.infoYP is partially supported by DFG grant PE 2299/1-1.de_DE
datacite.resourceTypeJournal Article-
datacite.resourceTypeGeneralText-
item.fulltextNo Fulltext-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.creatorOrcidClemens, Dennis-
item.creatorOrcidPerson, Yury-
item.creatorGNDClemens, Dennis-
item.creatorGNDPerson, Yury-
item.openairetypeArticle-
item.grantfulltextnone-
item.languageiso639-1en-
item.mappedtypeArticle-
crisitem.funder.funderid501100001659-
crisitem.funder.funderrorid018mejw64-
crisitem.author.deptMathematik E-10-
crisitem.author.orcid0000-0001-5940-6556-
crisitem.author.orcid0000-0002-3091-3025-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik (E)-
Appears in Collections:Publications without fulltext
Show simple item record

Page view(s)

47
Last Week
0
Last month
3
checked on Nov 30, 2022

SCOPUSTM   
Citations

1
Last Week
0
Last month
checked on Jun 30, 2022

Google ScholarTM

Check

Add Files to Item

Note about this record

Cite this record

Export

Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.