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

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

Namespace Prefixes

PrefixIRI
n21http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n19http://purl.org/net/nknouf/ns/bibtex#
n16http://localhost/temp/predkladatel/
n17http://linked.opendata.cz/resource/domain/vavai/projekt/
n8http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/ontology/domain/vavai/
n22http://linked.opendata.cz/resource/domain/vavai/zamer/
n15https://schema.org/
n18http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F10%3A10050547%21RIV11-GA0-11320___/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n14http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n11http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F10%3A10050547%21RIV11-GA0-11320___
rdf:type
n12:Vysledek skos:Concept
dcterms:description
The invisibility graph I(X) of a set X in a Euclidean space is a (possibly infinite) graph whose vertices are the points of X and two vertices are connected by an edge if and only if the straight-line segment connecting the two corresponding points is not fully contained in X. We settle a conjecture of Matoušek and Valtr claiming that for invisibility graphs of planar sets, the chromatic number cannot be bounded in terms of the clique number. The invisibility graph I(X) of a set X in a Euclidean space is a (possibly infinite) graph whose vertices are the points of X and two vertices are connected by an edge if and only if the straight-line segment connecting the two corresponding points is not fully contained in X. We settle a conjecture of Matoušek and Valtr claiming that for invisibility graphs of planar sets, the chromatic number cannot be bounded in terms of the clique number.
dcterms:title
On three parameters of invisibility graphs On three parameters of invisibility graphs
skos:prefLabel
On three parameters of invisibility graphs On three parameters of invisibility graphs
skos:notation
RIV/00216208:11320/10:10050547!RIV11-GA0-11320___
n3:aktivita
n5:Z n5:S n5:P
n3:aktivity
P(1M0545), P(GD201/09/H057), S, Z(MSM0021620838)
n3:dodaniDat
n11:2011
n3:domaciTvurceVysledku
n8:2011883 n8:6484522 n8:5546729 n8:6863116
n3:druhVysledku
n13:D
n3:duvernostUdaju
n20:S
n3:entitaPredkladatele
n18:predkladatel
n3:idSjednocenehoVysledku
276947
n3:idVysledku
RIV/00216208:11320/10:10050547
n3:jazykVysledku
n14:eng
n3:klicovaSlova
chromatic number; clique number; Euclidean space; invisibility graph
n3:klicoveSlovo
n4:chromatic%20number n4:invisibility%20graph n4:clique%20number n4:Euclidean%20space
n3:kontrolniKodProRIV
[1C3C288888B3]
n3:mistoKonaniAkce
Nha Trang, Vietnam
n3:mistoVydani
Berlin
n3:nazevZdroje
Computing and Combinatorics
n3:obor
n6:BA
n3:pocetDomacichTvurcuVysledku
4
n3:pocetTvurcuVysledku
5
n3:projekt
n17:GD201%2F09%2FH057 n17:1M0545
n3:rokUplatneniVysledku
n11:2010
n3:tvurceVysledku
Valtr, Pavel Cibulka, Josef Stolař, Rudolf Mészáros, Viola Kynčl, Jan
n3:typAkce
n21:WRD
n3:zahajeniAkce
2010-07-19+02:00
n3:zamer
n22:MSM0021620838
s:issn
0302-9743
s:numberOfPages
7
n19:hasPublisher
Springer-Verlag
n15:isbn
3-642-14030-0
n16:organizacniJednotka
11320