Ramsey-type constructions for arrangements of segments
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10103921" target="_blank" >RIV/00216208:11320/12:10103921 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.ejc.2011.09.006" target="_blank" >http://dx.doi.org/10.1016/j.ejc.2011.09.006</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ejc.2011.09.006" target="_blank" >10.1016/j.ejc.2011.09.006</a>
Alternative languages
Result language
angličtina
Original language name
Ramsey-type constructions for arrangements of segments
Original language description
Improving a result of Karolyi, Pach and Toth, we construct an arrangement of n segments in the plane with at most n^{log{8} / log{169}} pairwise crossing or pairwise disjoint segments.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
European Journal of Combinatorics
ISSN
0195-6698
e-ISSN
—
Volume of the periodical
33
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
4
Pages from-to
336-339
UT code for WoS article
—
EID of the result in the Scopus database
—