Loading...
Please wait, while we are loading the content...
Similar Documents
Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
| Content Provider | Scilit |
|---|---|
| Author | Pikhurko, Oleg Vaughan, Emil R. |
| Copyright Year | 2013 |
| Description | Erdős asked in 1962 about the value off(n,k,l), the minimum number ofk-cliques in a graph with ordernand independence number less thanl. The case (k,l)=(3,3) was solved by Lorden. Here we solve the problem (for all largen) for (3,l) with 4 ≤l≤ 7 and (k,3) with 4 ≤k≤ 7. Independently, Das, Huang, Ma, Naves and Sudakov resolved the cases (k,l)=(3,4) and (4,3). |
| Related Links | http://arxiv.org/pdf/1203.4393 https://www.cambridge.org/core/services/aop-cambridge-core/content/view/5E1D88F9BEA63D1DB27B2E2BF9C4D6B5/S0963548313000357a.pdf/div-class-title-minimum-number-of-span-class-italic-k-span-cliques-in-graphs-with-bounded-independence-number-div.pdf |
| Ending Page | 934 |
| Page Count | 25 |
| Starting Page | 910 |
| ISSN | 09635483 |
| e-ISSN | 14692163 |
| DOI | 10.1017/s0963548313000357 |
| Journal | Combinatorics, Probability and Computing |
| Issue Number | 6 |
| Volume Number | 22 |
| Language | English |
| Publisher | Cambridge University Press (CUP) |
| Publisher Date | 2013-10-01 |
| Access Restriction | Open |
| Subject Keyword | Combinatorics, Probability and Computing Primary 05c35 Secondary 90c35 |
| Content Type | Text |
| Resource Type | Article |
| Subject | Applied Mathematics Statistics and Probability Theoretical Computer Science Computational Theory and Mathematics |
