Asymptotic Structure for the Clique Density Theorem
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kim, Jaehoon | ko |
| dc.contributor.author | Liu, Hong | ko |
| dc.contributor.author | Pikhurko, Oleg | ko |
| dc.contributor.author | Sharifzadeh, Maryam | ko |
| dc.date.accessioned | 2021-02-02T01:30:04Z | - |
| dc.date.available | 2021-02-02T01:30:04Z | - |
| dc.date.created | 2021-01-27 | - |
| dc.date.created | 2021-01-27 | - |
| dc.date.created | 2021-01-27 | - |
| dc.date.created | 2021-01-27 | - |
| dc.date.created | 2021-01-27 | - |
| dc.date.created | 2021-01-27 | - |
| dc.date.created | 2021-01-27 | - |
| dc.date.issued | 2020-12 | - |
| dc.identifier.citation | DISCRETE ANALYSIS, v.2020, no.19, pp.1 - 26 | - |
| dc.identifier.issn | 2397-3129 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/280439 | - |
| dc.description.abstract | The famous Erdos-Rademacher problem asks for the smallest number of r-cliques in a graph with the given number of vertices and edges. Despite decades of active attempts, the asymptotic value of this extremal function for all r was determined only recently, by Reiher [Annals of Mathematics, 184 (2016) 683-707]. Here we describe the asymptotic structure of all almost extremal graphs. This task for r = 3 was previously accomplished by Pikhurko and Razborov [Combinatorics, Probability and Computing, 26 (2017) 138-160]. | - |
| dc.language | English | - |
| dc.publisher | ALLIANCE DIAMOND OPEN ACCESS JOURNALS | - |
| dc.title | Asymptotic Structure for the Clique Density Theorem | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000604632200001 | - |
| dc.identifier.scopusid | 2-s2.0-85131725601 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 2020 | - |
| dc.citation.issue | 19 | - |
| dc.citation.beginningpage | 1 | - |
| dc.citation.endingpage | 26 | - |
| dc.citation.publicationname | DISCRETE ANALYSIS | - |
| dc.identifier.doi | 10.19086/da.18559 | - |
| dc.contributor.localauthor | Kim, Jaehoon | - |
| dc.contributor.nonIdAuthor | Liu, Hong | - |
| dc.contributor.nonIdAuthor | Pikhurko, Oleg | - |
| dc.contributor.nonIdAuthor | Sharifzadeh, Maryam | - |
| dc.description.isOpenAccess | Y | - |
| dc.type.journalArticle | Article | - |
| dc.subject.keywordAuthor | graph limits | - |
| dc.subject.keywordAuthor | graphon | - |
| dc.subject.keywordAuthor | clique density theorem | - |
| dc.subject.keywordAuthor | stability | - |
| dc.subject.keywordAuthor | etc | - |
| dc.subject.keywordPlus | NUMBER | - |
| dc.subject.keywordPlus | GRAPHS | - |
| dc.subject.keywordPlus | TRIANGLES | - |
| dc.subject.keywordPlus | SUBGRAPH | - |
- Appears in Collection
- MA-Journal Papers(저널논문)
- Files in This Item
- 18559-asymptotic-structure-for-the-clique-densi...(439.68 kB)Download
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.