DC FieldValueLanguage
dc.contributor.authorClemens, Dennis-
dc.contributor.authorMiralaei, Meysam-
dc.contributor.authorReding, Damian-
dc.contributor.authorSchacht, Mathias-
dc.contributor.authorTaraz, Anusch-
dc.date.accessioned2021-11-25T11:32:56Z-
dc.date.available2021-11-25T11:32:56Z-
dc.date.issued2021-
dc.identifier.citationCombinatorics Probability and Computing : 1-16 (2021) (in press; CC BY 4.0)de_DE
dc.identifier.issn0963-5483de_DE
dc.identifier.urihttp://hdl.handle.net/11420/11074-
dc.description.abstractThe size-Ramsey number of a graph F is the smallest number of edges in a graph G with the Ramsey property for F, that is, with the property that any 2-colouring of the edges of G contains a monochromatic copy of F. We prove that the size-Ramsey number of the grid graph on n × n vertices is bounded from above by n 3+o(1).en
dc.language.isoende_DE
dc.relation.ispartofCombinatorics, probability & computingde_DE
dc.titleOn the size-Ramsey number of grid graphsde_DE
dc.typeArticlede_DE
dc.type.diniarticle-
dcterms.DCMITypeText-
tuhh.abstract.englishThe size-Ramsey number of a graph F is the smallest number of edges in a graph G with the Ramsey property for F, that is, with the property that any 2-colouring of the edges of G contains a monochromatic copy of F. We prove that the size-Ramsey number of the grid graph on n × n vertices is bounded from above by n 3+o(1).de_DE
tuhh.publisher.doi10.1017/S0963548320000322-
tuhh.publication.instituteMathematik E-10de_DE
tuhh.type.opus(wissenschaftlicher) Artikel-
dc.type.driverarticle-
dc.type.casraiJournal Article-
tuhh.container.startpage1de_DE
tuhh.container.endpage16de_DE
dc.identifier.scopus2-s2.0-85103840183-
datacite.resourceTypeJournal Article-
datacite.resourceTypeGeneralText-
item.languageiso639-1en-
item.grantfulltextnone-
item.creatorOrcidClemens, Dennis-
item.creatorOrcidMiralaei, Meysam-
item.creatorOrcidReding, Damian-
item.creatorOrcidSchacht, Mathias-
item.creatorOrcidTaraz, Anusch-
item.mappedtypeArticle-
item.creatorGNDClemens, Dennis-
item.creatorGNDMiralaei, Meysam-
item.creatorGNDReding, Damian-
item.creatorGNDSchacht, Mathias-
item.creatorGNDTaraz, Anusch-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.cerifentitytypePublications-
crisitem.author.deptMathematik E-10-
crisitem.author.deptMathematik E-10-
crisitem.author.deptMathematik E-10-
crisitem.author.orcid0000-0001-5940-6556-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
Appears in Collections:Publications without fulltext
Show simple item record

Page view(s)

34
Last Week
0
Last month
checked on Aug 8, 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.