This HTML5 document contains 58 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/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n9https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n5https://web.archive.org/web/20090324073835/http:/ilib.mirror1.mccme.ru/djvu/mp2/
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Tibor_Radó
dbo:wikiPageWikiLink
dbr:Covering_problem_of_Rado
dbp:knownFor
dbr:Covering_problem_of_Rado
dbo:knownFor
dbr:Covering_problem_of_Rado
Subject Item
dbr:Covering_problem_of_rado
dbo:wikiPageWikiLink
dbr:Covering_problem_of_Rado
dbo:wikiPageRedirects
dbr:Covering_problem_of_Rado
Subject Item
dbr:Covering_problem_of_Rado
rdf:type
yago:Statement106722453 yago:Abstraction100002137 yago:Message106598915 yago:WikicatCoveringLemmas yago:Problem114410605 yago:State100024720 dbo:Disease yago:WikicatUnsolvedProblemsInMathematics yago:Communication100033020 yago:Condition113920835 yago:Attribute100024264 yago:Lemma106751833 yago:Proposition106750804 yago:Difficulty114408086
rdfs:label
Covering problem of Rado
rdfs:comment
The covering problem of Rado is an unsolved problem in geometry concerning covering planar sets by squares. It was formulated in 1928 by Tibor Radó and has been generalized to more general shapes and higher dimensions by Richard Rado.
dcterms:subject
dbc:Unsolved_problems_in_geometry dbc:Covering_lemmas dbc:Discrete_geometry
dbo:wikiPageID
21261359
dbo:wikiPageRevisionID
1083916901
dbo:wikiPageWikiLink
dbc:Unsolved_problems_in_geometry dbr:Wacław_Sierpiński dbr:Miklós_Ajtai dbr:Geometry dbc:Covering_lemmas dbr:Tibor_Radó dbr:Convex_set dbr:Disk_(mathematics) dbr:Victor_Zalgaller dbr:Richard_Rado dbr:Cube dbr:Hexagon dbr:Homothetic_transformation dbr:Cover_(topology) dbr:Euclidean_space dbr:Richard_K._Guy dbr:Giuseppe_Vitali dbc:Discrete_geometry dbr:Tibor_Rado
dbo:wikiPageExternalLink
n5:mp2-5.htm
owl:sameAs
n9:4iRD8 yago-res:Covering_problem_of_Rado freebase:m.05c3snl wikidata:Q5179259
dbp:wikiPageUsesTemplate
dbt:Isbn
dbo:abstract
The covering problem of Rado is an unsolved problem in geometry concerning covering planar sets by squares. It was formulated in 1928 by Tibor Radó and has been generalized to more general shapes and higher dimensions by Richard Rado.
gold:hypernym
dbr:Problem
prov:wasDerivedFrom
wikipedia-en:Covering_problem_of_Rado?oldid=1083916901&ns=0
dbo:wikiPageLength
4162
foaf:isPrimaryTopicOf
wikipedia-en:Covering_problem_of_Rado
Subject Item
dbr:List_of_unsolved_problems_in_mathematics
dbo:wikiPageWikiLink
dbr:Covering_problem_of_Rado
Subject Item
wikipedia-en:Covering_problem_of_Rado
foaf:primaryTopic
dbr:Covering_problem_of_Rado