This HTML5 document contains 45 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n11http://localhost/temp/predkladatel/
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n9http://linked.opendata.cz/resource/domain/vavai/projekt/
n19http://linked.opendata.cz/resource/domain/vavai/subjekt/
n18http://linked.opendata.cz/ontology/domain/vavai/
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F13%3A10145589%21RIV14-GA0-11320___/
shttp://schema.org/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
rdfshttp://www.w3.org/2000/01/rdf-schema#
skoshttp://www.w3.org/2004/02/skos/core#
n17http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n8http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F13%3A10145589%21RIV14-GA0-11320___
rdf:type
skos:Concept n18:Vysledek
rdfs:seeAlso
http://link.springer.com/article/10.1007%2Fs00373-012-1137-3
dcterms:description
We prove that the crossing number of a graph decays in a %22continuous fashion%22 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. We prove that the crossing number of a graph decays in a %22continuous fashion%22 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.
dcterms:title
Improvement on the decay of crossing numbers Improvement on the decay of crossing numbers
skos:prefLabel
Improvement on the decay of crossing numbers Improvement on the decay of crossing numbers
skos:notation
RIV/00216208:11320/13:10145589!RIV14-GA0-11320___
n18:predkladatel
n19:orjk%3A11320
n4:aktivita
n13:I n13:S n13:P
n4:aktivity
I, P(GEGIG/11/E023), S
n4:cisloPeriodika
3
n4:dodaniDat
n12:2014
n4:domaciTvurceVysledku
n14:3347540 n14:6484522
n4:druhVysledku
n10:J
n4:duvernostUdaju
n20:S
n4:entitaPredkladatele
n16:predkladatel
n4:idSjednocenehoVysledku
79314
n4:idVysledku
RIV/00216208:11320/13:10145589
n4:jazykVysledku
n7:eng
n4:klicovaSlova
Embedding method; Crossing number
n4:klicoveSlovo
n8:Crossing%20number n8:Embedding%20method
n4:kodStatuVydavatele
JP - Japonsko
n4:kontrolniKodProRIV
[6339F461503A]
n4:nazevZdroje
Graphs and Combinatorics
n4:obor
n15:BA
n4:pocetDomacichTvurcuVysledku
2
n4:pocetTvurcuVysledku
3
n4:projekt
n9:GEGIG%2F11%2FE023
n4:rokUplatneniVysledku
n12:2013
n4:svazekPeriodika
29
n4:tvurceVysledku
Kynčl, Jan Černý, Jakub Tóth, Géza
n4:wos
000318875700006
s:issn
0911-0119
s:numberOfPages
7
n17:doi
10.1007/s00373-012-1137-3
n11:organizacniJednotka
11320