DC Field | Value | Language |
---|---|---|
dc.contributor.author | Clemens, Dennis | - |
dc.contributor.author | Miralaei, Meysam | - |
dc.contributor.author | Reding, Damian | - |
dc.contributor.author | Schacht, Mathias | - |
dc.contributor.author | Taraz, Anusch | - |
dc.date.accessioned | 2021-11-25T11:32:56Z | - |
dc.date.available | 2021-11-25T11:32:56Z | - |
dc.date.issued | 2021 | - |
dc.identifier.citation | Combinatorics Probability and Computing : 1-16 (2021) (in press; CC BY 4.0) | de_DE |
dc.identifier.issn | 0963-5483 | de_DE |
dc.identifier.uri | http://hdl.handle.net/11420/11074 | - |
dc.description.abstract | The 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.iso | en | de_DE |
dc.relation.ispartof | Combinatorics, probability & computing | de_DE |
dc.title | On the size-Ramsey number of grid graphs | de_DE |
dc.type | Article | de_DE |
dc.type.dini | article | - |
dcterms.DCMIType | Text | - |
tuhh.abstract.english | The 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.doi | 10.1017/S0963548320000322 | - |
tuhh.publication.institute | Mathematik E-10 | de_DE |
tuhh.type.opus | (wissenschaftlicher) Artikel | - |
dc.type.driver | article | - |
dc.type.casrai | Journal Article | - |
tuhh.container.startpage | 1 | de_DE |
tuhh.container.endpage | 16 | de_DE |
dc.identifier.scopus | 2-s2.0-85103840183 | - |
datacite.resourceType | Journal Article | - |
datacite.resourceTypeGeneral | Text | - |
item.languageiso639-1 | en | - |
item.grantfulltext | none | - |
item.creatorOrcid | Clemens, Dennis | - |
item.creatorOrcid | Miralaei, Meysam | - |
item.creatorOrcid | Reding, Damian | - |
item.creatorOrcid | Schacht, Mathias | - |
item.creatorOrcid | Taraz, Anusch | - |
item.mappedtype | Article | - |
item.creatorGND | Clemens, Dennis | - |
item.creatorGND | Miralaei, Meysam | - |
item.creatorGND | Reding, Damian | - |
item.creatorGND | Schacht, Mathias | - |
item.creatorGND | Taraz, Anusch | - |
item.fulltext | No Fulltext | - |
item.openairetype | Article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
item.cerifentitytype | Publications | - |
crisitem.author.dept | Mathematik E-10 | - |
crisitem.author.dept | Mathematik E-10 | - |
crisitem.author.dept | Mathematik E-10 | - |
crisitem.author.orcid | 0000-0001-5940-6556 | - |
crisitem.author.parentorg | Studiendekanat Elektrotechnik, Informatik und Mathematik | - |
crisitem.author.parentorg | Studiendekanat Elektrotechnik, Informatik und Mathematik | - |
crisitem.author.parentorg | Studiendekanat Elektrotechnik, Informatik und Mathematik | - |
Appears in Collections: | Publications without fulltext |
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.