DC Field | Value | Language |
---|---|---|
dc.contributor.author | Holmsen, Andreas F. | ko |
dc.date.accessioned | 2021-01-05T17:50:10Z | - |
dc.date.available | 2021-01-05T17:50:10Z | - |
dc.date.created | 2020-03-23 | - |
dc.date.created | 2020-03-23 | - |
dc.date.created | 2020-03-23 | - |
dc.date.created | 2020-03-23 | - |
dc.date.issued | 2020-08 | - |
dc.identifier.citation | COMBINATORICA, v.40, no.4, pp.527 - 537 | - |
dc.identifier.issn | 0209-9683 | - |
dc.identifier.uri | http://hdl.handle.net/10203/279573 | - |
dc.description.abstract | A result due to Gyarfas, Hubenko, and Solymosi (answering a question of Erd}os) states that if a graph G on n vertices does not contain K2;2 as an induced subgraph yet has at least c n 2 edges, then G has a complete subgraph on at least c2 10 n vertices. In this paper we suggest a \higher-dimensional" analogue of the notion of an induced K2;2 which allows us to generalize their result to k-uniform hypergraphs. Our result also has an interesting consequence in discrete geometry. In particular, it implies that the fractional Helly theorem can be derived as a purely combinatorial consequence of the colorful Helly theorem | - |
dc.language | English | - |
dc.publisher | SPRINGER HEIDELBERG | - |
dc.title | Large Cliques in Hypergraphs with Forbidden Substructures | - |
dc.type | Article | - |
dc.identifier.wosid | 000518081800004 | - |
dc.identifier.scopusid | 2-s2.0-85081020776 | - |
dc.type.rims | ART | - |
dc.citation.volume | 40 | - |
dc.citation.issue | 4 | - |
dc.citation.beginningpage | 527 | - |
dc.citation.endingpage | 537 | - |
dc.citation.publicationname | COMBINATORICA | - |
dc.identifier.doi | 10.1007/s00493-019-4169-y | - |
dc.contributor.localauthor | Holmsen, Andreas F. | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | 05C35 | - |
dc.subject.keywordAuthor | 05C65 | - |
dc.subject.keywordAuthor | 52A35 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.