making triangles colorful
Clicks: 129
ID: 219876
2013
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
129 views
9 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #17 of 19 articles by views in canadian journal of infectious diseases and medical microbiology
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
We prove that for any point set P in the plane, a triangle T, and a positive integer k, there exists a coloring of P with k colors such that any homothetic copy of T containing at least 144k8 points of P contains at least one of each color. This is the first polynomial bound for range spaces induced by homothetic polygons.The only previously known bound for this problem applies to the more general case of octants in ℝ3, but is doubly exponential.
| Reference Key |
cardinal2013journalmaking
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Jean Cardinal;Kolja Knauer;Piotr Micek;Torsten Ueckerdt |
| Journal | canadian journal of infectious diseases and medical microbiology |
| Year | 2013 |
| DOI |
10.20382/jocg.v4i1a10
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.