Improvement on the decay of crossing numbers

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10145589" target="_blank" >RIV/00216208:11320/13:10145589 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/article/10.1007%2Fs00373-012-1137-3" target="_blank" >http://link.springer.com/article/10.1007%2Fs00373-012-1137-3</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00373-012-1137-3" target="_blank" >10.1007/s00373-012-1137-3</a>

Result language
angličtina
Original language name
Improvement on the decay of crossing numbers
Original language description
We prove that the crossing number of a graph decays in a "continuous fashion" in the following sense. For any epsilon > 0 there is a delta > 0 such that for a sufficiently large n, every graph G with n vertices and m a parts per thousand yen n (1+epsilon) edges, has a subgraph G' of at most (1 - delta)m edges and crossing number at least (1 - epsilon)CR(G). This generalizes the result of J. Fox and Cs. Tóth.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/GEGIG%2F11%2FE023" target="_blank" >GEGIG/11/E023: Graph Drawings and Representations</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)